Documents Related by Co-Citation

44 Inductive Data Type Systems – Frédéric Blanqui, Jean-pierre Jouannaud, Mitsuhiro Okada - 1997
176 The Size-Change Principle for Program Termination – Chin Soon Lee, Neil D. Jones, Amir M. Ben-amram - 2001
77 Monadic Presentations of Lambda Terms Using Generalized Inductive Types – Thorsten Altenkirch, Bernhard Reus - 1999
260 Programming in Martin-Löf’s Type Theory. An Introduction – B Nordström, K Petersson, J M Smith - 1990
83 Infinite Objects in Type Theory – Thierry Coquand
52 Calculating Sized Types – Wei-ngan Chin, Siau-cheng Khoo - 2001
120 Proving the correctness of reactive systems using sized types – John Hughes, Lars Pareto, Amr Sabry - 1996
170 Towards a practical programming language based on dependent type theory – Ulf Norell - 2007
12 Inductive Types and Strong Normalization – Altenkirch Constructions - 1993
7 Specification and Verification of a Formal System for Structurally Recursive Functions – Andreas Abel - 2000
18 Logical Relations and Inductive/coinductive Types – Thorsten Altenkirch - 1998
5 Proving innermost termination automatically – T Arts, J Giesl - 1997
702 Types and programming languages – Benjamin C Pierce - 2002
31 Termination analysis for functional programs using term orderings – Jürgen Giesl - 1995
70 Codifying guarded definitions with recursive schemes – Eduardo Giménez - 1995
12 Codifying guarded de with recursive schemes – Eduardo Gimenez - 1994
85 Pattern matching with dependent types – Thierry Coquand - 1992
10 Ensuring termination in ESFP – A Telford, D Turner - 2000
4 Speci and veri of a formal system for structurally recursive functions – Andreas Abel - 2000