Checking algorithms for Pure Type Systems

DOI10.1007/3-540-58085-9_71MaRDI QIDQ6083689zbMATH OpenFDO

Authors

Publication date 8 December 2023

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

Full work available at URL https://doi.org/10.1007/3-540-58085-9_71

Mathematics Subject Classification ID

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

Cites work

• (In)consistency of Extensions of Higher Order Logic and Type Theory
• A framework for defining logics
• A Perspective in Theoretical Computer Science
• scientific article; zbMATH DE number 4180832 (Why is no real title available?)
• scientific article; zbMATH DE number 4191621 (Why is no real title available?)
• scientific article; zbMATH DE number 3657156 (Why is no real title available?)
• scientific article; zbMATH DE number 65530 (Why is no real title available?)
• scientific article; zbMATH DE number 1302061 (Why is no real title available?)
• scientific article; zbMATH DE number 512787 (Why is no real title available?)
• scientific article; zbMATH DE number 1400716 (Why is no real title available?)
• Introduction to generalized type systems
• The calculus of constructions
• Theoretical Pearls:Representing ‘undefined’ in lambda calculus
• Type checking with universes
• Typing in pure type systems

Cited in

(4)

• Algorithmic type checking for a pi-calculus with name matching and session types
• scientific article; zbMATH DE number 1692949 (Why is no real title available?)
• Type Checking by Domain Analysis in Ampersand
• Programming Languages and Systems

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

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