A Partial Type Checking Algorithm for Type:Type

DOI10.1016/J.ENTCS.2011.02.013zbMath1291.68106OpenAlexW2157073125WikidataQ61583766 ScholiaQ61583766MaRDI QIDQ5166618

Thorsten Altenkirch, Andreas Abel

Publication date: 27 June 2014

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

Full work available at URL: https://doi.org/10.1016/j.entcs.2011.02.013

zbMATH Keywords

pure type systemsdependent typestype checkingType:Type

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (1)

Unnamed Item

Uses Software

• LEGO
• Cayenne

Cites Work

• Unnamed Item
• Call-by-name, call-by-value and the \(\lambda\)-calculus
• An algorithm for type-checking dependent types
• Remarks on the equational theory of non-normalizing pure type systems
• Verifying a Semantic βη-Conversion Test for Martin-Löf Type Theory
• Domain-free pure type systems
• Cayenne—a language with dependent types
• Foundations of Software Science and Computational Structures

This page was built for publication: A Partial Type Checking Algorithm for Type:Type