Polytypic unification

DOI10.1017/S095679689800313XMaRDI QIDQ4236981zbMATH OpenFDO

Authors Patrik Jansson, Johan Jeuring

Publication date 28 March 1999

Published in Journal of Functional Programming (Search for Journal in Brave)

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

zbMATH Keywords

pattern matching

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Recommendations

• Unification: a multidisciplinary survey
• Unification with extended patterns
• scientific article; zbMATH DE number 36613
• scientific article; zbMATH DE number 3871321

Cited in

(8)

• Datatype-generic termination proofs
• Specification of logic programming languages from reusable semantic building blocks
• A lightweight approach to datatype-generic rewriting
• Monadic constraint programming
• Une charpente de semi-unification
• scientific article; zbMATH DE number 7453112 (Why is no real title available?)
• Generic unification via two-level types and parameterized modules
• Optimizing the Runtime Processing of Types in Polymorphic Logic Programming Languages

This page was built for publication: Polytypic unification

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