The TLCA series of conferences serves as a forum for presenting original research results that are broadly relevant to the theory and applications of typed calculi. The following list of topics is non-exhaustive: Proof-theory: Natural deduction and sequent calculi, cut elimination and normalisation, linear logic and proof nets, type-theoretic aspects of computational complexity Semantics: Denotational semantics, game semantics, realisability, categorical models Implementation: Abstract machines, parallel execution, optimal reduction, type systems for program optimisation Types: Subtypes, dependent types, type inference, polymorphism, types in theorem proving Programming: Foundational aspects of functional and object-oriented programming, proof search and logic programming, connections between and combinations of functional and logic programming, type checking
Member of the Program Committee - 9th International Conference on Typed Lambda Calculi and Applications
PAOLINI, LUCA LUIGI
2009-01-01
Abstract
The TLCA series of conferences serves as a forum for presenting original research results that are broadly relevant to the theory and applications of typed calculi. The following list of topics is non-exhaustive: Proof-theory: Natural deduction and sequent calculi, cut elimination and normalisation, linear logic and proof nets, type-theoretic aspects of computational complexity Semantics: Denotational semantics, game semantics, realisability, categorical models Implementation: Abstract machines, parallel execution, optimal reduction, type systems for program optimisation Types: Subtypes, dependent types, type inference, polymorphism, types in theorem proving Programming: Foundational aspects of functional and object-oriented programming, proof search and logic programming, connections between and combinations of functional and logic programming, type checkingI documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.