| Publication | Date of Publication | Type |
|---|
(Head-)normalization of typeable rewrite systems
Rewriting Techniques and Applications | 2022-12-09 | Paper |
| A fully-abstract semantics of \(\lambda\mu\) in the \(\pi\)-calculus | 2021-06-24 | Paper |
A fully-abstract semantics of \(\lambda\mu\) in the \(\pi\)-calculus
(available as arXiv preprint) | 2021-06-24 | Paper |
| Characterisation of strongly normalising \(\lambda\mu\)-terms | 2021-06-10 | Paper |
Characterisation of strongly normalising \(\lambda\mu\)-terms
(available as arXiv preprint) | 2021-06-10 | Paper |
| scientific article; zbMATH DE number 7167773 (Why is no real title available?) | 2020-02-14 | Paper |
Approximation and normalization results for typeable term rewriting systems
Higher-Order Algebra, Logic, and Term Rewriting | 2019-01-11 | Paper |
Intersection types for the \(\lambda\mu\)-calculus
(available as arXiv preprint) | 2018-01-12 | Paper |
Orchestrated session compliance
Journal of Logical and Algebraic Methods in Programming | 2016-11-30 | Paper |
Strict intersection types for the lambda calculus
ACM Computing Surveys | 2014-08-13 | Paper |
| Intersection and union types for \(\mathcal{X}\) | 2013-10-02 | Paper |
| Implementing \(\mathcal{X}\) | 2013-09-25 | Paper |
Strongly normalising cut-elimination with strict intersection types
Electronic Notes in Theoretical Computer Science | 2013-08-16 | Paper |
Completeness and soundness results for \(\mathcal X\) with intersection and union types
Fundamenta Informaticae | 2013-01-24 | Paper |
An Output-Based Semantics of Λμ with Explicit Substitution in the π-Calculus
Lecture Notes in Computer Science | 2012-09-21 | Paper |
Completeness and partial soundness results for intersection and union typing for \(\overline{\lambda}\mu\tilde{\mu}\)
Annals of Pure and Applied Logic | 2011-08-26 | Paper |
Approximation semantics and expressive predicate assignment for object-oriented programming (extended abstract)
Lecture Notes in Computer Science | 2011-06-17 | Paper |
A Filter Model for the λμ-Calculus
Lecture Notes in Computer Science | 2011-06-17 | Paper |
Logical semantics for the first order \(\varrho \)-calculus.
Lecture Notes in Computer Science | 2010-02-23 | Paper |
A Logical Interpretation of the λ-Calculus into the π-Calculus, Preserving Spine Reduction and Types
CONCUR 2009 - Concurrency Theory | 2009-10-22 | Paper |
Computation with classical sequents
Mathematical Structures in Computer Science | 2008-08-15 | Paper |
The heart of intersection type assignment: Normalisation proofs revisited
Theoretical Computer Science | 2008-06-24 | Paper |
Logical equivalence for subtyping object and recursive types
Theory of Computing Systems | 2008-04-11 | Paper |
Programming Languages and Systems
Lecture Notes in Computer Science | 2007-05-02 | Paper |
Theoretical Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Theoretical Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Cut-elimination in the strict intersection type assignment system is strongly normalizing
Notre Dame Journal of Formal Logic | 2005-07-06 | Paper |
Intersection types for explicit substitutions
Information and Computation | 2004-11-23 | Paper |
| scientific article; zbMATH DE number 2086241 (Why is no real title available?) | 2004-08-11 | Paper |
Normalization, approximation, and semantics for combinator systems
Theoretical Computer Science | 2003-01-21 | Paper |
| scientific article; zbMATH DE number 1696608 (Why is no real title available?) | 2002-07-22 | Paper |
Intersection types for \(\lambda\)-trees
Theoretical Computer Science | 2002-03-03 | Paper |
| scientific article; zbMATH DE number 1499110 (Why is no real title available?) | 2000-09-03 | Paper |
| scientific article; zbMATH DE number 1354138 (Why is no real title available?) | 1999-10-31 | Paper |
Comparing cubes of typed and type assignment systems
Annals of Pure and Applied Logic | 1997-10-23 | Paper |
Normalization results for typeable rewrite systems
Information and Computation | 1997-06-16 | Paper |
Intersection type assignment systems
Theoretical Computer Science | 1997-02-27 | Paper |
| scientific article; zbMATH DE number 883895 (Why is no real title available?) | 1996-07-21 | Paper |
| scientific article; zbMATH DE number 512770 (Why is no real title available?) | 1994-10-24 | Paper |
Principal Type Schemes for the Strict Type Assignment System
Journal Of Logic And Computation | 1994-03-27 | Paper |
Complete restrictions of the intersection type discipline
Theoretical Computer Science | 1992-09-27 | Paper |
