An ideal model for recursive polymorphic types
Information and Control
Faithful ideal models for recursive polymorphic types
Proceedings of the Fourth Annual Symposium on Logic in computer science
Recursion over realizability structures
Information and Computation
PER models of subtyping, recursive types and higher-order polymorphism
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Handbook of logic in computer science (vol. 3)
From operational semantics to domain theory
Information and Computation
Names, equations, relations: practical ways to reason about new
Fundamenta Informaticae - Special issue: typed lambda-calculi and applications, selected papers
Higher order operational techniques in semantics
Higher order operational techniques in semantics
Operational reasoning for functions with local state
Higher order operational techniques in semantics
Reasoning about functions with effects
Higher order operational techniques in semantics
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Relational interpretations of recursive types in an operational setting
Information and Computation
Regular expression types for XML
ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Intersection types and computational effects
ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
An indexed model of recursive types for foundational proof-carrying code
ACM Transactions on Programming Languages and Systems (TOPLAS)
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Coinductive Axiomatization of Recursive Type Equality and Subtyping
TLCA '97 Proceedings of the Third International Conference on Typed Lambda Calculi and Applications
Relational Semantics for Recursive Types and Bounded Quantification
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
Labelled Reductions, Runtime Errors and Operational Subsumption
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Logical Relations for Monadic Types
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
XDuce: A statically typed XML processing language
ACM Transactions on Internet Technology (TOIT)
Locus Solum: From the rules of logic to the logic of rules
Mathematical Structures in Computer Science
Parametric polymorphism and operational equivalence
Mathematical Structures in Computer Science
Journal of Functional Programming
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
Frame rules from answer types for code pointers
Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Syntactic Logical Relations for Polymorphic and Recursive Types
Electronic Notes in Theoretical Computer Science (ENTCS)
Semantic subtyping: Dealing set-theoretically with function, union, intersection, and negation types
Journal of the ACM (JACM)
A System F with Call-by-Name Exceptions
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Compiling functional types to relational specifications for low level imperative code
Proceedings of the 4th international workshop on Types in language design and implementation
On the Values of Reducibility Candidates
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
Biorthogonality, step-indexing and compiler correctness
Proceedings of the 14th ACM SIGPLAN international conference on Functional programming
Semantic foundations for typed assembly languages
ACM Transactions on Programming Languages and Systems (TOPLAS)
On the stability by union of reducibility candidates
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Strong normalization and equi-(co)inductive types
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
Step-indexed kripke models over recursive worlds
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A typed, compositional logic for a stack-based abstract machine
APLAS'05 Proceedings of the Third Asian conference on Programming Languages and Systems
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Reducibility and ⊤⊤-lifting for computation types
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
Step-Indexed syntactic logical relations for recursive and quantified types
ESOP'06 Proceedings of the 15th European conference on Programming Languages and Systems
Copatterns: programming infinite structures by observations
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Wellfounded recursion with copatterns: a unified approach to termination and productivity
Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
| Hi-index | 0.00 |
We present a generalization of the ideal model for recursive polymorphic types. Types are defined as sets of terms instead of sets of elements of a semantic domain. Our proof of the existence of types (computed by fixpoint of a typing operator) does not rely on metric properties, but on the fact that the identity is the limit of a sequence of projection terms. This establishes a connection with the work of Pitts on relational properties of domains. This also suggests that ideals are better understood as closed sets of terms defined by orthogonality with respect to a set of contexts.