Simply-typed underdeterminism

An extension of the simply-typed lambda calculus with constructs for expressing a notion calledunderdeterminism is studied. 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]  Leon Henkin,et al.  Completeness in the theory of types , 1950, Journal of Symbolic Logic.

[2]  Johan Bos,et al.  Predicate logic unplugged , 1996 .

[3]  Carroll Morgan,et al.  Programming from specifications , 1990, Prentice Hall International Series in computer science.

[4]  Ewen Denney.  Refinement types for specification , 1998, PROCOMET.

[5]  Eugenio Moggi,et al.  Notions of Computation and Monads , 1991, Inf. Comput..

[6]  Dirk van Dalen,et al.  Logic and structure , 1980 .

[7]  J. Barkley Rosser,et al.  On the consistency of Quine's New foundations for mathematical logic , 1939, Journal of Symbolic Logic.

[8]  John C. Mitchell,et al.  Foundations for programming languages , 1996, Foundation of computing series.

[9]  Bart Jacobs,et al.  Fibrations with Indeterminates: Contextual and Functional Completeness for Polymorphic Lambda Calculi , 1995, Math. Struct. Comput. Sci..