Decidability properties of recursive types.

DOI10.1007/B13810MaRDI QIDQ5897364zbMATH OpenOpenAlexFDO

Authors Felice Cardone, Mario Coppo

Publication date 23 February 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b13810

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Decidability of theories and sets of sentences (03B25) Semantics in the theory of computing (68Q55) Abstract data types; algebraic specification (68Q65)

Recommendations

• Isomorphisms of generic recursive polynomial types
• scientific article; zbMATH DE number 1705161
• scientific article; zbMATH DE number 3938562
• Efficient and flexible matching of recursive types
• scientific article; zbMATH DE number 1183236

Cited in

(7)

• An abstract decision procedure for satisfiability in the theory of recursive data types
• On equal -terms
• Differential interaction nets
• Decidability in Intuitionistic Type Theory is Functionally Decidable
• Isomorphisms of generic recursive polynomial types
• Calculi, types and applications: essays in honour of M. Coppo, M. Dezani-Ciancaglini and S. Ronchi della Rocca
• Subtyping for F-bounded quantifiers and equirecursive types

This page was built for publication: Decidability properties of recursive types.

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