Polymorphic recursion and semi-unification

DOI10.1007/3-540-52753-2_41MaRDI QIDQ4268483zbMATH OpenFDO

Authors Hans Leiß

Publication date 28 October 1999

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

Full work available at URL https://doi.org/10.1007/3-540-52753-2_41

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Grammars and rewriting systems (68Q42)

Cited in

(2)

• Extending the type checker of Standard ML by polymorphic recursion
• Constructive Many-one Reduction from the Halting Problem to Semi-unification (Extended Version)

This page was built for publication: Polymorphic recursion and semi-unification

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