James Hugh McKinna  Home/Search
Context Related
| dcs.ed.ac.uk/pub/jhm/thesis.ps.gz 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: dur.ac.uk/~dcs7ttg...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This thesis considers the problem of program correctness within a rich theory of dependent types, the Extended Calculus of Constructions (ECC). This system contains a powerful programming language of higher-order primitive recursion and higher-order intuitionistic logic. It is supported by Pollack's versatile LEGO implementation, which I use extensively to develop the mathematical constructions studied here. I systematically investigate Burstall's notion of deliverable, that is, a program... (Update)
Context of citations to this paper: More
...relational structures. Similar structures are used by O Hearn and Tennent [100] for the semantics of local variables. McKinna and Burstall [92] have the notion of deliverables, which are pairs consisting of a functional program and a proof, together with pre and post...
...particularly from a Computer Science point of view. Similar notions have been studied, for a variety of purposes, by Burstall and McKinna [28], O Hearn and Tennent [32] and Pitts [33] Definition 1 Let C be a category. A specification structure S over C is defined by the...
Cited by: More
Program Extraction in simply-typed Higher Order Logic - Berghofer (2002) (Correct)
A Type-theoretic Approach to Deadlock-freedom of.. - Abramsky, Gay, Nagarajan (1997) (Correct)
Specification Structures and Propositions-as-Types for.. - Abramsky, Gay, Nagarajan (1995) (Correct)
Similar documents (at the sentence level):
14.1%: Proceedings Of The 1992 Workshop On Types For Proofs And.. - Nordström, Petersson.. (1992) (Correct)
Active bibliography (related documents): More All
0.9: Program Specification and Data Refinement in Type Theory - Luo (1991) (Correct)
0.8: An Extended Calculus of Constructions - Luo (1990) (Correct)
0.7: Inductive Data Types: Well-ordering Types Revisited - Goguen, Luo (1992) (Correct)
Similar documents based on text: More All
0.2: On Quotients Of Hopf Fibrations - Loo, Verjovsky (1994) (Correct)
0.1: The Effects of Caching on Reconfigurable Adaptive Computing Systems - Hendry (2003) (Correct)
0.1: Some Lambda Calculus and Type Theory Formalized - McKinna, Pollack (1998) (Correct)
Related documents from co-citation: More All
13: The LEGO proof development system: A user's manual (context) - Luo, Pollack - 1992
13: Implementing Mathematics with the Nuprl Proof Development System - Constable - 1986
12: Program specification and data refinement in type theory - Luo - 1991
BibTeX entry: (Update)
R. Burstall and J. McKinna. Deliverables : a categorical approach to program development in type theory. Technical Report 92-242, LFCS, October 1992. Also in [NPP92]. http://citeseer.ist.psu.edu/mckinna92deliverables.html More
@inproceedings{ mckinna93deliverables,
author = "James McKinna and Rod Burstall",
title = "Deliverables: {A} categorical approach to program development in type theory",
booktitle = "Proceedings of Mathematical Foundation of Computer Science",
year = "1993",
url = "citeseer.ist.psu.edu/mckinna92deliverables.html" }
Citations (may not include all citations):650 An axiomatic basis for computer programming (context) - Hoare - 1969
505 Implementing Mathematics with the NuPrl Proof Development Sy.. - Constable - 1986
434 A Framework for Defining Logics - Harper, Honsell et al.
359 An Introduction to Higher-Order Categorical Logic (context) - Lambek, Scott - 1986
236 Intuitionistic Type Theory (context) - Martin-Lof - 1984
191 LEGO Proof Development System: User's Manual (context) - Luo, Pollack - 1992
147 abstraction and parametric polymorphism (context) - Reynolds - 1983
143 Theorems for Free - Wadler - 1989
141 Predicate Calculus and Program Semantics (context) - Dijkstra, Scholten - 1990
132 Interpretation fonctionelle et elimination des coupures dans.. (context) - Girard - 1972
99 Foundations of Constructive Analysis (context) - Bishop - 1967
98 Using dependent types to express modular structure - MacQueen - 1986
97 An Introduction to Inductive Definitions (context) - Aczel - 1977
96 A survey of the project AUTOMATH (context) - de Bruijn
95 an Extended Calculus of Constructions - Luo - 1989
95 An Extended Calculus of Constructions - Luo - 1990
83 Topos Theory (context) - Johnstone - 1977
77 Nondeterminacy and Formal Derivation of Programs (context) - Dijkstra, Commands - 1975
73 Inductively defined types (context) - Coquand, Paulin-Mohring
71 An Intuitionistic Theory of Types: Predicative part (context) - Martin-Lof - 1975
64 Metamathematical Investigations of a Calculus of Constructio.. (context) - Coquand
64 A classical introduction to modern number theory (context) - Ireland, Rosen - 1990
60 Constructions: a Higher-order Proof system for mechanizing m.. (context) - Coquand, Huet - 1985
53 Towards formal development of ML programs: foundations and m.. - Sannella, Tarlecki - 1989
53 Automatic synthesis of typed -programs on term algebras (context) - Bohm, Berarducci - 1985
43 Identity and Existence in Intuitionistic Logic (context) - Scott - 1977
39 Do-it-yourself Type Theory (context) - Backhouse, Chisholm et al. - 1988
34 Categorical Type Theory (context) - Jacobs - 1991
34 Equality in hyperdoctrines and the comprehension schema as a.. (context) - Lawvere - 1970
33 Adjointness in foundations (context) - Lawvere - 1969
31 s programs from proofs in the Calculus of Constructions (context) - Paulin-Mohring - 1989
30 The Theory of Constructions: Categorical Semantics and Topos.. (context) - Hyland, Pitts - 1986
29 A category-theoretic account of program modules - Moggi - 1991
29 Correctness and completeness of a categorical semantics of C.. (context) - Streicher - 1989
28 The Church-Rosser property for fij-reduction in typed - calc.. (context) - Geuvers - 1991
26 Locally Cartesian Closed Categories and Type Theory (context) - Seely - 1984
25 Program Specification and Data Refinement in Type Theory - Luo - 1991
24 An Higher-order Calculus and Theory Abstraction - Luo - 1988
24 An Higher-order Calculus and Theory Abstraction - Luo - 1991
24 Partial Objects in Constructive Type Theory (context) - Constable, Fraser - 1987
23 Constructive validity (context) - Scott - 1970
21 Prentice-Hall (context) - Dijkstra, of - 1976
20 Technical Report ECS-LFCS (context) - Harper, Milner et al. - 1989
19 Formal Theories for Transfinite Iterations of Generalised In.. (context) - Feferman - 1970
19 Representing Logics in Type Theory (context) - Gardner - 1992
17 Relating Theories of the -calculus (context) - Scott
17 Natural Deduction: a Proof-Theoretic Study (context) - Prawitz - 1965
17 Reasoning about functional programs and complexity classes a.. (context) - Leivant - 1983
15 Union and Intersection Types for Program Extraction (context) - Hayashi - 1991
15 Toposes and Local set theories (context) - Bell - 1990
14 The logic of topoi (context) - Fourman - 1977
14 The discrete objects in the effective topos (context) - Hyland, Robinson et al. - 1991
13 Data refinement in a categorical setting (context) - Hoare - 1987
11 Implicit Syntax - Pollack
11 University of Edinburgh (context) - Mendler, of et al. - 1992
11 Adjunction of semifunctors: categorical structures in nonext.. (context) - Hayashi - 1985
11 The theory of LEGO (context) - Pollack - 1989
9 Deliverables: an approach to program development in Construc.. (context) - Burstall, McKinna
8 Selected writings on Computing (context) - Dijkstra - 1982
6 Extracting and Executing Programs developed in the Inductive.. (context) - Paulin-Mohring, Werner
6 Type checking with universes - Harper, Pollack - 1991
6 A problem of adequacy: conservativity of Calculus of Constru.. (context) - Luo - 1990
6 Inductive data types: Well-ordering types revisited - Goguen, Luo - 1991
5 Department of Computer Science (context) - Mason, in et al. - 1987
5 On Information Discharging and Retrieval in Martin-L of's ty.. (context) - Salvesen - 1989
4 A Preliminary User's Manual (context) - Luo, Pollack et al. - 1989
4 An algebraic formulation of data refinement (context) - Power - 1990
3 Indexed Categories and their Applications (context) - Johnstone, Pare - 1978
3 A simple theory of types (context) - Church - 1940
3 The Theory of Constructions (context) - Coquand, Huet - 1988
3 An approach to Program Specification and Development in Cons.. (context) - Burstall - 1989
3 A unifying theory of dependent types (context) - Luo - 1991
3 s type theory (context) - Nordstrom, Petersson et al. - 1990
3 Predicates and Fibrations (context) - Pavlovic - 1990
2 Categories and Allegories (context) - Freyd, Scedrov - 1990
2 essays in Combinatory Logic (context) - Seldin, Hindley et al. - 1980
2 Formal specification of ML programs (context) - Sannella - 1986
2 Annals of Pure and Applied Logic (context) - Boileau, Joyal et al. - 1981
2 Natural Deduction and the Beck Condition (context) - Seely - 1983
1 van Dalen Constructivism in Mathematics I+II (context) - Troelstra - 1988
1 available from pt@doc (context) - Taylor, tex
1 survey article in: The Handbook of Logic in Computer Science (context) - Barendregt, types
1 A Categorical Semantics of Constructions (context) - Ehrard - 1988
1 The ECC extended with inductive types (context) - Ore - 1989
1 calculus and Proof Theory (context) - Stenlund - 1972
1 lecture notes for the Summer School in -calculus (context) - Barendregt, Barendsen et al. - 1991
1 available as LFCS report ECS-LFCS (context) - Moggi, partial et al. - 1988
1 The Church-Rosser Property for the LF with fij-reduction (context) - Salvesen - 1990
1 ATT: Optimised Curry-Howard isomorphism for Program Extracti.. (context) - Hayashi - 1990
1 Fibred categories and the foundations of na ve category theo.. (context) - Benabou - 1985
1 Springer Graduate Texts in Mathematics (context) - Categories, WorkingMathematician - 1971
1 The Church-Rosser Property for Pure Type Systems with fij- r.. (context) - Salvesen - 1991
1 the strength of the subset type in MartinL of's type theory (context) - Salvesen, Smith - 1988
1 paper presented at the LMS Symposium on Category Theory and .. (context) - Reynolds, Ma et al. - 1991
1 Scuola di Specializzazione in Logica Matematica (context) - Martin-Lof, meaning et al. - 1985
1 Dipartimento di Informatica (context) - Berardi, Dependence et al. - 1990
1 formulae-as-types (context) - Howard
1 Pitman Research Notes in Theoretical Computer Science (context) - Curien, Combinators et al. - 1986
1 draft of a paper given at the LogFIT Summer School in Proof .. (context) - Pollack, Syntax - 1990
1 Aarhus Lecture Notes no (context) - Kock, Wraith et al. - 1971
1 Rapports Techniques no (context) - Huet, Coquand et al. - 1989
1 Ergebnisse der Mathematik und ihrer Grenzgebiete (context) - Bishop, Constructive - 1985
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.dur.ac.uk/~dcs7ttg/publications.html): More
A Deciding Algorithm for Linear Isomorphism of Types with.. - Andreev, Soloviev (1997) (Correct)
A Higher-order Calculus and Theory Abstraction - Luo (1988) (Correct)
ECC, an Extended Calculus of Constructions - Luo (1989) (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