Pure type systems with explicit substitution

DOI10.1017/S096012950000325XMaRDI QIDQ2713351zbMATH OpenFDO

Authors Roel Bloo

Publication date 7 May 2001

Published in Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S096012950000325X

zbMATH Keywords

pure type systems

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Recommendations

• Pure type systems with explicit substitutions
• Pure type systems with subtyping. (Extended abstract)
• scientific article; zbMATH DE number 512787
• Pure type systems with definitions
• Typing in pure type systems
• Type inference for pure type systems
• scientific article; zbMATH DE number 2185650
• Domain-free pure type systems
• Domain-free pure type systems
• Intersection type systems and explicit substitutions calculi

Cited in

(8)

• Revisiting the notion of function
• Absolute explicit unification
• scientific article; zbMATH DE number 2185650 (Why is no real title available?)
• Pure type systems with subtyping. (Extended abstract)
• Pure type systems with definitions
• Pure Type Systems with de Bruijn Indices
• Pure subtype systems
• Pure type systems with explicit substitutions

Describes a project that uses

Uses Software

• Automath

This page was built for publication: Pure type systems with explicit substitution

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