Adequacy for a lazy functional language with recursive and polymorphic types

DOI10.1016/0304-3975(94)00129-7zbMath0874.68160OpenAlexW2005302754WikidataQ126401668 ScholiaQ126401668MaRDI QIDQ1349683

Bettina Blaaberg, Christian Clausen

Publication date: 27 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(94)00129-7

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Domain theoretic models of polymorphism
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Adequacy for a lazy functional language with recursive and polymorphic types