(Enter summary)
Abstract: We study an extension of the simply-typed lambda calculus with constructs for expressing a
notion we call underdeterminism. This allows us to interpret notions of stub and skeleton used in
top-down program development. We axiomatise a simple notion of program refinement, and give a
semantics, for which the calculus is proved sound and complete.
1 (Update)
Context of citations to this paper: More
...us that the term #x : #.# nat , # # carries the same information as #x : #. nat# 1 Some of the work of this chapter was presented in [Den97b] 52 and ##(nat#) We would like to prove equivalences such as this, and in general consider a specialisation ordering at each...
Cited by: More
A Theory of Program Refinement - Denney (1998)
(Correct)
Active bibliography (related documents): More All
0.2: Full Abstraction, Totality and PCF - Plotkin (1997)
(Correct)
0.2: Type Refinements - Harper, Pfenning (2001)
(Correct)
0.1: Premonoidal Categories and Notions of Computation - Power, Robinson (1995)
(Correct)
Similar documents based on text: More All
0.4: Refining Refinement Types - Denney (1997)
(Correct)
0.1: A Client-Side Stub Interpreter - Kessler (1994)
(Correct)
0.1: Integrating Top-Down and Bottom-Up Sensory Processing By.. - Siegel, Körding, König (2000)
(Correct)
Related documents from co-citation: More All
2: Deliverables : a categorical approach to program development in type theory
- Burstall, McKinna - 1992
2: Toward formal development of programs from algebraic specifications: Implementat..
- Sannella, Tarlecki - 1988
BibTeX entry: (Update)
Ewen Denney. Simply-typed Underdeterminism. In EU KIT/ IOS International Workshop on Formal Models of Programming and their Applications, Institute of Software, Beijing, 1997. To appear in special issue of Journal of Computer Science and Technology. http://citeseer.ist.psu.edu/denney98simplytyped.html More
@misc{ denney97simplytyped,
author = "E. Denney",
title = "Simply-typed Underdeterminism",
text = "Ewen Denney. Simply-typed Underdeterminism. In EU KIT/ IOS International
Workshop on Formal Models of Programming and their Applications, Institute
of Software, Beijing, 1997. To appear in special issue of Journal of Computer
Science and Technology.",
year = "1997",
url = "citeseer.ist.psu.edu/denney98simplytyped.html" }
Citations (may not include all citations):
369
Information and Computation (context) - Moggi, computation - 1991
293
Programming from Specifications (context) - Morgan - 1994
229
Foundations for Programming Languages (context) - Mitchell - 1996
191
LEGO Proof Development System : User's Manual (context) - Luo, Pollack - 1992
86
Completeness in the theory of types (context) - Henkin - 1950
65
Predicate logic unplugged
- Bos - 1995
33
Logic and Structure (context) - van Dalen - 1994
6
Fibrations with indeterminates : Contextual and functional c.. (context) - Hermida, Jacobs - 1995
5
Refinement Types for Specification
- Denney - 1998
2
the Consistency of Quine's New Foundations for Mathematical .. (context) - Rosser - 1939
Documents on the same site (http://www.dai.ed.ac.uk/~ewd/): More
A Theory of Program Refinement - Denney (1998)
(Correct)
An Operational Semantics of the Java Card Firewall - Eluard, Jensen, Denney (2001)
(Correct)
A Prototype Proof Translator from HOL to Coq - Denney (2000)
(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