Refinement types and computational duality

Proceedings of the 2009 ACM SIGPLAN Workshop on Programming Languages meets Program Verification, PLPV'09

Volumn , Issue , 2009, Pages 15-26

  Zeilberger, Noam ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DEFUNCTIONALIZATIONS; DESCRIPTORS; EVALUATION ORDER; PROGRAMMING LANGUAGE; PROOF THEORY; SIDE EFFECT; SUBTYPINGS; TYPE SYSTEMS;

COMPUTER SOFTWARE SELECTION AND EVALUATION; FORMAL LANGUAGES; FORMAL LOGIC; FUNCTIONAL PROGRAMMING; INTERSECTIONS; LINGUISTICS; SYNTACTICS;

PROGRAM INTERPRETERS;

EID: 70149092598     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (27)

1. ean-Marc Andreoli. Logic programming with focusing proofs in linear logic. Journal of Logic and Computation, 2(3):297-347, 1992.
2. Franco Barbanera, Mariangiola Dezani-Ciancaglini, and Ugo De'Liguoro. Intersection and union types: syntax and semantics. Information and Compution, 119(2):202-230, 1995.
3. Henk Barendregt, Mario Coppo, and Mariangiola Dezani-Ciancaglini. A filter lambda model and the completeness of type assignment. The Journal of Symbolic Logic, 48(4):931-940, 1983.
4. James Brotherston and Alex Simpson. Complete sequent calculi for induction and infinite descent. In IEEE Symposium on Logic in Computer Science, pages 51-60, July 2007.
5. Wilfried Buchholz. Notation systems for infinitary derivations. Archive for Mathematical Logic, 30:277-296, 1991.
6. Pierre-Louis Curien and Hugo Herbelin. The duality of computation. In ACM SIGPLAN International Conference on Functional Programming, pages 233-243. 2000.
7. Olivier Danvy. On evaluation contexts, continuations, and the rest of the computation. In CW'04: Proceedings of the Fourth ACM-SIGPLAN Continuation Workshop, 2004.
8. Rowan Davies and Frank Pfenning. Intersection types and computational effects. In ACM SIGPLAN International Conference on Functional Programming, pages 198-208, 2000. (Pubitemid 32024722)
9. Joshua Dunfield and Frank Pfenning. Tridirectional typechecking. In ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 281-292, January 2004.
10. Andrzej Filinski. Declarative continuations and categorical duality. Master's thesis, University of Copenhagen, 1989. Computer Science Department
11. Tim Freeman and Frank Pfenning. Refinement types for ML. In Programming Language Design and Implementation, pages 268-277, 1991.
12. Jean-Yves Girard. Locus solum: From the rules of logic to the logic of rules. Mathematical Structures in Computer Science, 11(3):301-506, 2001.
13. Bob Harper and Mark Lillibridge. ML with callcc is unsound, 1991. Post to TYPES mailing list, July 8, 1991, archived at http://www.seas. upenn.edu/~sweirich/types/archive/1991/msg00034.html.
14. Haruo Hosoya, Jérôme Vouillon, and Benjamin C. Pierce. Regular expression types for XML. In ACM SIGPLAN International Conference on Functional Programming, pages 11-22, 2000. (Pubitemid 32024706)
15. Imre Lakatos. Proofs and Refutations. Cambridge University Press, New York, NY, 1976.
16. Søren B. Lassen and Paul Blain Levy. Typed normal form bisimulation. In Jacques Duparc and Thomas A. Henzinger, editors, CSL, volume 4646 of Lecture Notes in Computer Science, pages 283-297. Springer, 2007.
17. Per Martin-Löf. Hauptsatz for the intuitionistic theory of iterated inductive definitions. In J. E. Fenstad, editor, Proceedings of the Second Scandinavian Logic Symposium, pages 179-216, Amsterdam, 1971.
18. Paul-André Melliès and Jérôme Vouillon. Recursive polymorphic types and parametricity in an operational framework. In IEEE Symposium on Logic in Computer Science, pages 82-91, 2005. (Pubitemid 41462555)
19. Grigori E. Mints. Finite investigations of transfinite derivations. Journal of Soviet Mathematics, 10:548-596, 1978. Appears in Grigori Mints, Selected papers in Proof Theory. Bibliopolis, 1992.
20. Ulf Norell. Towards a practical programming language based on dependent type theory. PhD thesis, Chalmers University of Technology, 2007.
21. Frank Pfenning. Church and Curry: Combining intrinsic and extrinsic typing. Studies in Logic and the Foundations of Mathematics, 2008. Festschrift in Honor of Peter B. Andrews on His 70th Birthday.
22. John C. Reynolds. The meaning of types: From intrinsic to extrinsic semantics. Report RS-00-32, University of Aarhus, December 2000.
23. Peter Selinger. Control categories and duality: on the categorical semantics of the lambda-mu calculus. Mathematical Structures in Computer Science, 11(2):207-260, 2001. (Pubitemid 33248129)
24. Jérôme Vouillon. Polymorphic regular tree types and patterns. In ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, January 2006.
25. Andrew K. Wright. Simple imperative polymorphism. Lisp and Symbolic Computation, 8(4):343-355, 1995.
26. Noam Zeilberger. On the unity of duality. Annals of Pure and Applied Logic, 153(1), 2008a. Special issue on "Classical Logic and Computation
27. Noam Zeilberger. Focusing and higher-order abstract syntax. In ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages,pages 359-369, January 2008b.