Lexicographic Path Induction

DOI10.1007/978-3-642-02273-9_21zbMath1246.68078OpenAlexW1564857934MaRDI QIDQ3637202

Jeffrey Sarnat, Carsten Schuermann

Publication date: 7 July 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-642-02273-9_21

Mathematics Subject Classification ID

Theory of programming languages (68N15) Combinatory logic and lambda calculus (03B40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cut-elimination for a logic with definitions and induction
• Cut-elimination and a permutation-free sequent calculus for intuitionistic logic
• Proof-theoretic analysis of termination proofs
• Types for Proofs and Programs

This page was built for publication: Lexicographic Path Induction