A liberal type system for functional logic programs

DOI10.1017/S0960129513000091MaRDI QIDQ5740645zbMATH OpenFDO

Authors F. J. López-Fraguas, Enrique Martin-Martin, Juan Rodríguez-Hortalá

Publication date 27 July 2016

Published in Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0960129513000091

Mathematics Subject Classification ID

Logic programming (68N17) Functional programming and lambda calculus (68N18)

Recommendations

• New results on type systems for functional logic programming
• Safe typing of functional logic programs with opaque patterns and local bindings
• A type system for logic programs
• scientific article; zbMATH DE number 1696583
• scientific article; zbMATH DE number 2048606

Cites work

• A theory of type polymorphism in programming
• An approach to declarative programming based on a rewriting logic
• Automatically generating counterexamples to naive free theorems
• Generics for the masses
• Multi-paradigm Declarative Languages
• New results on type systems for functional logic programming
• Normalization results for typeable rewrite systems
• Rewriting and Call-Time Choice: The HO Case

Cited in

(2)

• Safe typing of functional logic programs with opaque patterns and local bindings
• New results on type systems for functional logic programming

This page was built for publication: A liberal type system for functional logic programs

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