Semantics for classical AUTOMATH and related systems
Information and Control
An ideal model for recursive polymorphic types
Information and Control
Type inference with recursive types: syntax and semantics
Information and Computation
The semantics of second-order lambda-calculus
Logical foundations of functional programming
ACM Transactions on Programming Languages and Systems (TOPLAS)
Isomorphisms of types: from &lgr;-calculus to information retrieval and language design
Isomorphisms of types: from &lgr;-calculus to information retrieval and language design
Uniqueness of Scott's reflexive domain in P&ohgr;
Theoretical Computer Science
Coinductive axiomatization of recursive type equality and subtyping
Fundamenta Informaticae - Special issue: typed lambda-calculi and applications, selected papers
Initial Algebra Semantics and Continuous Algebras
Journal of the ACM (JACM)
Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
A Completeness Theorem for Recursively Defined Types
Proceedings of the 12th Colloquium on Automata, Languages and Programming
Syntactic Considerations on Recursive Types
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
An investigation of a programming language with a polymorphic type structure.
An investigation of a programming language with a polymorphic type structure.
Subtyping recursive types modulo associative commutative products
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
| Hi-index | 5.24 |
We prove that the equivalence of recursive types induced by the equality of their infinite unfoldings coincides with the equality of their interpretations as closures over the -model P.