Semi-continuous Sized Types and Termination
From MaRDI portal
Publication:5900207
DOI10.2168/LMCS-4(2:3)2008zbMath1143.68013MaRDI QIDQ5900207
Publication date: 7 August 2008
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (9)
Size-based termination of higher-order rewriting ⋮ Deep induction: induction rules for (truly) nested types ⋮ Well-founded recursion with copatterns and sized types ⋮ Interactive programming in Agda – Objects and graphical user interfaces ⋮ Unnamed Item ⋮ Compositional Coinduction with Sized Types ⋮ A Tutorial on Type-Based Termination ⋮ Coalgebraic Reasoning in Coq: Bisimulation and the λ-Coiteration Scheme ⋮ On the Relation between Sized-Types Based Termination and Semantic Labelling
This page was built for publication: Semi-continuous Sized Types and Termination
