System ST toward a type system for extraction and proofs of programs

Abstract We introduce a new type system called “System ST” (ST stands for subtyping), based on subtyping, and prove the basic property of the system. We show the extraordinary expressive power of the system which leads us to think that it could be a good candidate for doing both proof and extraction of programs.

[1]  Michel Parigot,et al.  Programming with Proofs , 1990, J. Inf. Process. Cybern..

[2]  Catherine Parent,et al.  Synthesizing Proofs from Programs in the Calculus of Inductive Constructions , 1995, MPC.

[3]  Mariangiola Dezani-Ciancaglini,et al.  A new type assignment for λ-terms , 1978, Arch. Math. Log..

[4]  Paula Severi,et al.  Studies of a Theory of Specifications with Built-in Program Extraction , 2004, Journal of Automated Reasoning.

[5]  Stefano Berardi,et al.  Pruning Simply Typed Lambda-Terms , 1996, J. Log. Comput..

[6]  B. Pierce.  Programming with intersection types, union types, and polymorphism , 1991 .

[7]  François Pottier,et al.  Type Inference in the Presence of Subtyping: from Theory to Practice , 1998 .

[8]  Martin Hofmann,et al.  Positive subtyping , 1995, POPL '95.

[9]  Jean-Yves Girard,et al.  The System F of Variable Types, Fifteen Years Later , 1986, Theor. Comput. Sci..

[10]  Christine Paulin-Mohring,et al.  Extracting ω's programs from proofs in the calculus of constructions , 1989, POPL '89.

[11]  Michel Parigot.  Recursive Programming with Proofs , 1992, Theor. Comput. Sci..

[12]  Alonzo Church,et al.  A formulation of the simple theory of types , 1940, Journal of Symbolic Logic.

[13]  John C. Mitchell,et al.  Polymorphic Type Inference and Containment , 1988, Inf. Comput..

[14]  Michel Parigot,et al.  Programming with Proofs: A Second Order Type Theory , 1988, ESOP.

[15]  C. A. R. Hoare,et al.  An axiomatic basis for computer programming , 1969, CACM.

[16]  David Aspinall,et al.  Subtyping with Singleton Types , 1994, CSL.