Numbering matters

DOI10.1145/1016850.1016872MaRDI QIDQ5178033zbMATH OpenOpenAlexFDO

Authors N. Gauthier, François Pottier

Publication date 9 March 2015

Published in Proceedings of the ninth ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1016850.1016872

zbMATH Keywords

equalitypolymorphismrecursive typesunification

Mathematics Subject Classification ID

Logic in computer science (03B70) Theory of programming languages (68N15) Functional programming and lambda calculus (68N18)

Recommendations

• scientific article; zbMATH DE number 5033764
• Inductive types and type constraints in the second-order lambda calculus
• Type preorders and recursive terms
• Order-invariant types and their applications
• Some remarks on type systems for course-of-value recursion
• CPO-models for second order lambda calculus with recursive types and subtyping
• scientific article; zbMATH DE number 1377611
• scientific article; zbMATH DE number 956833
• An algebraic view on recursive types
• scientific article; zbMATH DE number 1863381

Cited in

(9)

• Efficient and flexible matching of recursive types
• A graph-based generic type system for object-oriented programs
• Implementing nominal unification
• Subtyping for F-bounded quantifiers and equirecursive types
• Efficient algorithms for isomorphisms of simple types
• Efficient algorithms for isomorphisms of simple types
• Polymorphic higher-order context-free session types
• System \(F^\mu_\omega\) with context-free session types
• A polynomial nominal unification algorithm

This page was built for publication: Numbering matters

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5178033)