A predicative analysis of structural recursion
From MaRDI portal
Publication:2784165
DOI10.1017/S0956796801004191zbMath0998.68027MaRDI QIDQ2784165
Thorsten Altenkirch, Andreas Abel
Publication date: 17 April 2002
Published in: Journal of Functional Programming (Search for Journal in Brave)
Related Items (11)
Proving properties of functional programs by equality saturation ⋮ Inductive Prover Based on Equality Saturation for a Lazy Functional Language ⋮ Verifying termination and reduction properties about higher-order logic programs ⋮ Size-based termination of higher-order rewriting ⋮ A sound strategy to compile general recursion into finite depth pattern matching ⋮ Distributing and parallelizing non-canonical loops ⋮ Interactive programming in Agda – Objects and graphical user interfaces ⋮ Termination checking with types ⋮ Compositional Coinduction with Sized Types ⋮ Adapting functional programs to higher order logic ⋮ Unnamed Item
Uses Software
This page was built for publication: A predicative analysis of structural recursion
