Correctness of a region-based binding-time analysis

Electronic Notes in Theoretical Computer Science

Volumn 6, Issue , 1997, Pages 365-390

  Thiemann, Peter J ^a  

^a UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); COMPUTER PROGRAMMING LANGUAGES; DIFFERENTIATION (CALCULUS); FUNCTION EVALUATION; INFORMATION ANALYSIS;

BINDING-TIME ANALYSIS (BTA); CALCULUS; HIGHER-ORDER LANGUAGES; LAMBDA CALCULUS; OFFLINE PARTIAL EVALUATION; OPERATIONAL SEMANTICS;

SEMANTICS;

EID: 18944399061     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)80148-3     Document Type: Conference Paper

References (33)

1. Lars Ole Andersen. Program Analysis and Specialization for the C Programming Language. PhD thesis, DIKU, University of Copenhagen, May 1994.
2. Barendregt H.P. The Lambda Calculus - Its Syntax and Semantics. 1984;North-Holland
3. Bondorf Anders, Danvy Olivier. Automatic autoprojection of recursive equations with global variables and abstract data types. Science of Programming. 16:(2):1991;151-195
4. Charles Consel and Olivier Danvy. For a better support of static data flow. In John Hughes, editor, Proc. Functional Programming Languages and Computer Architecture 1991, volume 523 of Lecture Notes in Computer Science, pages 496 - 519, Cambridge, MA, 1991. Springer-Verlag.
5. Charles Consel and Francois Noël. A general approach for run-time specialization and its application to C. In Proc. 23rd Annual ACM Symposium on Principles of Programming Languages, pages 145 - 156, St. Petersburg, Fla., January 1996. ACM Press.
6. Olivier Danvy and Andrzej Filinski. Abstracting control. In Proc. 1990 ACM Conference on Lisp and Functional Programming, pages 151 - 160, Nice, France, 1990. ACM Press.
7. Danvy Olivier, Filinski Andrzej. Representing control: A study of the CPS transformation. Mathematical Structures in Computer Science. 2:1992;361-391
8. Danvy Olivier, Malmkjaer Karoline, Palsberg Jens. The essence of eta-expansion in partial evaluation. Lisp and Symbolic Computation. 8:(3):July 1995;209-227
9. Dirk Dussart, Fritz Henglein, and Christian Mossin. Polymorphic recursion and subtype qualifications: Polymorphic binding-time analysis in polynomial time. In Alan Mycroft, editor, Proc. International Static Analysis Symposium, SAS'95, volume 983 of Lecture Notes in Computer Science, pages 118 - 136, Glasgow, Scotland, September 1995. Springer-Verlag.
10. Dirk Dussart, John Hughes, and Peter Thiemann. Type specialisation for imperative languages. In Mads Tofte, editor, Proc. International Conference on Functional Programming 1997, Amsterdam, The Netherlands, June 1997. ACM Press, New York.
11. Dussart Dirk, Thiemann Peter. Partial evaluation for higher-order languages with state. Berichte des Wilhelm-Schickard-Instituts WSI-97-XX. April 1997;Universität Tübingen
12. Gomard Carsten K. A self-applicable partial evaluator for the lambda-calculus. ACM Transactions on Programming Languages and Systems. 14:(2):1992;147-172
13. Hatcliff John. Mechanically verifying the correctness of an offline partial evaluator. Swierstra Doaitse, Hermenegildo Manuel. Programming Languages, Implementations, Logics, and Programs (PLILP '95), volume 982 of Lecture Notes in Computer Science. September 1995;279-298 Springer-Verlag, Utrecht, The Netherlands
14. Hatcliff John, Danvy Olivier. A computational formalization for partial evaluation. Mathematical Structures in Computer Science. 1997;. To appear
15. Fritz Henglein and Christian Mossin. Polymorphic binding-time analysis. In Donald Sannella, editor, Proc. 5th European Symposium on Programming, volume 788 of Lecture Notes in Computer Science, pages 287 - 301, Edinburgh, UK, April 1994. Springer-Verlag.
16. Jones Neil D., Gomard Carsten K., Sestoft Peter. Partial Evaluation and Automatic Program Generation. 1993;Prentice Hall
17. Proc. of the 4th Annual Symposium on Logic in Computer Science, Pacific Grove, CA, June 1989. IEEE Computer Society Press.
18. John M. Lucassen and David K. Gifford. Polymorphic effect systems. In Proc. 15th Annual ACM Symposium on Principles of Programming Languages, pages 47 - 57, San Diego, California, January 1988. ACM Press.
19. Torben M. Mogensen. Efficient self-interpretation in lambda calculus. Journal of Functional Programming. 2:(3):July 1992;345-364
20. Eugenio Moggi. Computational lambda-calculus and monads. In LICS 89 [17], pages 14 - 23.
21. Mosses Peter D. Denotational Semantics, volume B of Handbook of Theoretical Computer Science, chapter 11. 1990;Elsevier Science Publishers, Amsterdam
22. Moura Barbara, Consel Charles, Lawall Julia. Bridging the gap between functional and imperative languages. Publication interne. 1027:July 1996;. Irisa, Rennes, France
23. Nielson Flemming. A formal type system for comparing partial evaluators. Bjørner Dines, Andrei P., Ershov, Jones Neil D. Partial Evaluation and Mixed Computation. 1988;349-384 North-Holland, Amsterdam
24. Palsberg Jens. Correctness of binding-time analysis. Journal of Functional Programming. 3:(3):July 1993;347-364
25. Prank Pfenning. Elf: A language for logic definition and verified metaprogramming. In LICS 89 [17], pages 313 - 322.
26. Plotkin Gordon. Call-by-name, call-by-value and the λ-calculus. Theoretical Computer Science. 1:1975;125-159
27. John C. Reynolds. Definitional interpreters for higher-order programming languages. In ACM Annual Conference, pages 717 - 740, July 1972.
28. Amr Sabry and John Field. Reasoning about explicit and implicit representations of state. In Paul Hudak, editor, SIPL '93, ACM SIGPLAN Workshop on State in Programming Languages, pages 17 - 30, Copenhagen, Denmark, June 1993. Yale University, Department of Computer Science, New Haven, CT. Technical Report YALEU/DCS/RR-968.
29. Schmidt David A. Denotational Semantics, A Methodology for Software Development. 1986;Allyn and Bacon, Inc, Massachusetts
30. Talpin Jean-Pierre, Jouvelot Pierre. Polymorphic type, region and effect inference. Journal of Functional Programming. 2:(3):July 1992;245-272
31. Thiemann Peter. A unified framework for binding-time analysis. TAPSOFT '97: Theory and Practice of Software Development, volume 1214 of Lecture Notes in Computer Science. April 1997;742-756 Lille, France. Springer-Verlag
32. Mads Tofte and Jean-Pierre Talpin. Implementation of the typed call-by-value A-calculus using a stack of regions. In Proc. 21st Annual ACM Symposium on Principles of Programming Languages, pages 188 - 201, Portland, OG, January 1994. ACM Press.
33. Wand Mitchell. Specifying the correctness of binding-time analysis. Journal of Functional Programming. 3:(3):July 1993;365-387