Checking algorithms for Pure Type Systems

DOI10.1007/3-540-58085-9_71zbMath1527.03010MaRDI QIDQ6083689

No author found.

Publication date: 8 December 2023

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

Mathematics Subject Classification ID

Logic in computer science (03B70) Combinatory logic and lambda calculus (03B40) Type theory (03B38)

Cites Work

• The calculus of constructions
• Type checking with universes
• Typing in pure type systems
• (In)consistency of Extensions of Higher Order Logic and Type Theory
• A Perspective in Theoretical Computer Science
• A framework for defining logics
• Theoretical Pearls:Representing ‘undefined’ in lambda calculus
• Introduction to generalized type systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Checking algorithms for Pure Type Systems