Marcin Benke, Peter Dybjer, Patrik Jansson  Home/Search
Context Related
| cs.chalmers.se/~peterd/pap...Generic.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.chalmers.se/~peterd/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We show how to write generic programs and proofs in MartinL of type theory. To this end we consider several extensions of MartinL of's logical framework for dependent types. Each extension has a universe of codes (signatures) for inductively de ned sets with generic formation, introduction, elimination, and equality rules. These extensions are modeled on Dybjer and Setzer's nitely axiomatized theories of inductive-recursive de nitions, which also have universes of codes for sets,... (Update)
Cited by: More
"Scrap Your Boilerplate" Explained - Hinze, Löh, Oliveira (Correct)
Indexed Induction-Recursion - Dybjer, Setzer (2004) (Correct)
Active bibliography (related documents): More All
3.8: Universes for Generic Programs and Proofs in Dependent Type .. - Benke, Dybjer, Jansson (2003) (Correct)
0.6: Recursive Families of Inductive Types - Capretta (2000) (Correct)
0.4: Equational Reasoning in Type Theory - Capretta (2000) (Correct)
Similar documents based on text: More All
0.2: Functional Polytypic Programming Use and Implementation - Jansson (1997) (Correct)
0.2: Prototyping Generic Programming in Template Haskell - Jansson (2004) (Correct)
0.2: Strategies for Interactive Proof and Program - Development In Martin-L (Correct)
Related documents from co-citation: More All
2: Nested general recursion and partiality in type theory - Bove, Capretta - 2000
2: Formal Aspects of Computing (context) - Dybjer - 1994
2: On universes in type theory (context) - Palmgren - 1996
BibTeX entry: (Update)
M. Benke, P. Dybjer, and P. Jansson. Universes for generic programs and proofs in dependent type theory. Manuscript, March 2003. http://citeseer.ist.psu.edu/benke03universes.html More
@misc{ benke03universes,
author = "M. Benke and P. Dybjer and P. Jansson",
title = "Universes for generic programs and proofs in dependent type theory",
text = "M. Benke, P. Dybjer, and P. Jansson. Universes for generic programs and
proofs in dependent type theory. Manuscript, March 2003.",
year = "2003",
url = "citeseer.ist.psu.edu/benke03universes.html" }
Citations (may not include all citations):64 Science of Computer Programming (context) - Jay, for - 1995
34 Generic functional programming with types and relations (context) - Bird, de Moor et al. - 1996
23 a polytypic programming language extension (context) - Jansson, Jeuring - 1997
20 Universal Algebra (context) - Gr - 1979
20 a language with dependent types (context) - Augustsson - 1998
20 An initial algebra approach to the speci cation (context) - Goguen, Thatcher et al. - 1978
16 Functional Polytypic Programming (context) - Jansson - 2000
15 Intuitionistic Type Theory (context) - Martin-L - 1984
14 Distinguishing data structures and functions: The constructo.. - Jay - 2001
13 Generic programming within dependently typed programming (context) - Altenkirch, McBride - 2002
8 Inductively de ned types (context) - Coquand, Paulin - 1990
8 Universal algebra in type theory - Capretta - 1999
7 To appear in the lecture notes of the Summer School on Gener.. (context) - Hinze, Jeuring et al. - 2003
7 A set constructor for inductive sets in MartinL of's type t.. (context) - Petersson, Synek - 1989
5 Relational catamorphisms (context) - Backhouse - 1991
5 Indexed induction-recursion - Dybjer, Setzer - 2001
5 Indexed induction-recursion - Dybjer, Setzer - 2003
5 Polytypic proof construction - Pfeifer, Rue - 1999
4 Functional generic programming and type theory - Norell - 2002
4 Annals of Pure and Applied Logic (context) - Dybjer, Setzer et al. - 2003
3 Studies in Mechanical Veri cation of Mathematical Proofs (context) - Ruys - 1999
3 A nite axiomatization of inductive-recursive de nitions (context) - Dybjer, Setzer - 1999
3 Automatic synthesis of typed -programs on term algebras (context) - ohm, Berarducci - 1985
2 Towards generic programming in type theory (context) - Benke - 2002
2 Some tools for computer-assisted theorem proving in MartinL .. (context) - Benke - 2001
2 The Machine-Checked Literate Formalisation of Algebra in Typ.. (context) - Bayley - 1998
1 Workshop on Generic Programming (context) - Jansson, Jeuring et al. - 1998
Documents on the same site (http://www.cs.chalmers.se/~peterd/): More
Final Report - Febr Ua Ry (Correct)
A Finite Axiomatization of Inductive-Recursive Definitions - Dybjer, Setzer (1998) (Correct)
Inductive Definitions and Type Theory: An Introduction - Coquand, Dybjer (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC