Syntactic Considerations on Recursive Types

Authors:
Martin Abadi;Marcelo P. Fiore
Affiliations:
-;-
Venue:
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Year:
1996

Citing 7
Cited 18

Categories of partial morphisms and the λp-calculus

Proceedings of a tutorial and workshop on Category theory and computer programming
Recursion over realizability structures

Information and Computation
Inheritance as implicit coercion

Information and Computation
Systems programming with Modula-3

Systems programming with Modula-3
Semantics of programming languages: structures and techniques

Semantics of programming languages: structures and techniques
Subtyping recursive types

ACM Transactions on Programming Languages and Systems (TOPLAS)
Positive Recursive Type Assignment

MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science

Efficient and flexible matching of recursive types

Information and Computation
Type-preserving compilation of Featherweight Java

ACM Transactions on Programming Languages and Systems (TOPLAS)
A coinductive completeness proof for the equivalence of recursive types

Theoretical Computer Science
Linear Continuation-Passing

Higher-Order and Symbolic Computation
A relational account of call-by-value sequentiality

Information and Computation - Special issue: LICS'97
Isomorphisms of generic recursive polynomial types

Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Recursive subtyping revealed

Journal of Functional Programming
Numbering matters: first-order canonical forms for second-order recursive types

Proceedings of the ninth ACM SIGPLAN international conference on Functional programming
Subtyping, recursion, and parametric polymorphism in kernel fun

Information and Computation
A short survey of isomorphisms of types

Mathematical Structures in Computer Science
An Operational Domain-theoretic Treatment of Recursive Types

Electronic Notes in Theoretical Computer Science (ENTCS)
Subtyping recursion and parametric polymorphism in kernel fun

Information and Computation
A game semantics of linearly used continuations

FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Regular expression containment: coinductive axiomatization and computational interpretation

Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Dynamics for ML using Meta-Programming

Electronic Notes in Theoretical Computer Science (ENTCS)
Subtyping recursive types modulo associative commutative products

TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
Coinductive Axiomatization of Recursive Type Equality and Subtyping

Fundamenta Informaticae
A formal semantics for isorecursive and equirecursive state abstractions

ECOOP'13 Proceedings of the 27th European conference on Object-Oriented Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study recursive types from a syntactic perspective. In particular, we compare the formulations of recursive types that are used in programming languages and formal systems. Our main tool is a new syntactic explanation of type expressions as functors. We also introduce a simple logic for programs with recursive types in which we carry out our proofs.