Kent Petersson, Jan M. Smith  Home/Search
Context
Related
Links: ACM DBLP | cs.chalmers.se/~kentp/flag.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/~kentp/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Martin-Lof's type theory is a theory in which one can write both specifications and programs. By interpreting propositions as types, predicate logic is available when formulating a specification. The rules of type theory are formulated as tactics which makes a top down construction of programs possible. These ideas are illustrated by a formal derivation of a program for a partitioning problem. (Update)
Active bibliography (related documents): More All
0.0: Program Derivation by Proof Transformation - Anderson (1993) (Correct)
0.0: Higher Order Functions Considered Unnecessary for Higher Order.. - Goguen (1990) (Correct)
0.0: Higher-Order Horn Clauses - Gopalan Nadathur Duke (1990) (Correct)
Similar documents based on text: More All
0.4: An Asymptotically Optimal Algorithm for the - Dutch National Flag (Correct)
0.2: Martin-Löf's Type Theory - Nordström, Petersson, Smith (Correct)
0.2: Propositional Functions and Families of Types - Smith (1989) (Correct)
BibTeX entry: (Update)
@article{ petersson86program,
author = "Kent Petersson and Jan M. Smith",
title = "Program Derivation in Type Theory: A Partitioning Problem",
journal = "Computer Languages",
volume = "11",
number = "3/4",
pages = "161-172",
year = "1986",
url = "citeseer.ist.psu.edu/484137.html" }
Citations (may not include all citations):505 Implementing Mathematics with the NuPRL Proof Development Sy.. - Constable - 1986 ACM
322 volume 78 of Lecture Notes in Computer Science (context) - Gordon, Milner et al. - 1979
236 Intuitionistic Type Theory (context) - Martin-Lof - 1984
141 Constructive Mathematics and Computer Programming (context) - Martin-Lof ACM
101 A Discipline of Programming (context) - Dijkstra - 1976
17 First Steps Toward Inferential Programming (context) - Scherlis, Scott - 1983
1 Types and Specifications in Martin-Lof's Type Theory (context) - Nordstrom, Smith - 1984
1 Program Derivation in Type Theory: The Polish Flag Problem (context) - Petersson, Smith - 1985
1 Proofs and Programs (context) - Takasu - 1978
Documents on the same site (http://www.cs.chalmers.se/~kentp/):
A Set Constructor for Inductive Sets in Martin-Lof's Type.. - Kent Petersson Dan (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