Simple Proofs of Characterizing Strong Normalization for Explicit Substitution Calculi

DOI10.1007/978-3-540-73449-9_20zbMath1203.68076OpenAlexW1493247333MaRDI QIDQ5432345

Kentaro Kikuchi

Publication date: 2 January 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-73449-9_20

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Grammars and rewriting systems (68Q42) Combinatory logic and lambda calculus (03B40)

Related Items (2)

Characterising Strongly Normalising Intuitionistic Sequent Terms ⋮ Intersection Types for the Resource Control Lambda Calculi

This page was built for publication: Simple Proofs of Characterizing Strong Normalization for Explicit Substitution Calculi