Computing with contexts a simple approach

Electronic Notes in Theoretical Computer Science

Volumn 10, Issue , 1998, Pages 134-149

  Sands, David ^a  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DATA STRUCTURES; FUNCTIONS; MATHEMATICAL OPERATORS; SEMANTICS; THEOREM PROVING;

BINDING OPERATORS; CONTEXTUAL EQUIVALENCE; HOLE-FILLING; LAMBDA ABSTRACTION;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0004664676     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)80694-2     Document Type: Conference Paper

References (19)

1. Abramsky S. The lazy lambda calculus. Tunner D. Research Topics in Functional Programming. 1990;65-116 Addison Wesley
2. Agha Gul A., Mason Ian A., Smith Scott F., Talcott Carolyn L. A foundation for actor computation. Journal of Functional Programming. 7:(1):January 1997;1-72
3. Huet G., Lang B. Proving and applying program transformations expressed with second order patterns. Acta Inf. 11:(1):January 1978;31-55
4. Hashimoto M., Ohori A. A typed context calculus. Technical Report RIMS-1098, Research Institute for Mathematical Sciences, Kyoto University. 1998
5. Lee S., Friedman D. Enriching the lambda calculus with contexts: Toward a theory of incremental program construction. In Proceedings of the 1996 ACM SIGPLAN International Conference on Functional Programming. May 1996;239-250
6. Mason I. Parametric computation. In CATS'96. 1996
7. Mayr R., Nipkow T. Higher-order rewrite systems and their confluence. Technical Report Sep26 - 1, Technical University of Munich. September 1995
8. Moran A. Call-by-name, Call-by-need, and McCarthy's Amb. PhD thesis, Department of Computing Sciences. September 1998;Chalmers, Sweden
9. Moran A., Sands D. A context lemma for call-by-need. Working Note. Jan. 1998;. Revised May, 1998
10. Mason I., Talcott C. Equivalence in functional languages with effects. Journal of Functional Programming. 1:(3):July 1991;287-327
11. Nordström Bengt, Petersson Kent, Smith Jan M. Programming in Martin-Löf's Type Theory: An Introduction, volume 7 of International Series of Monographs on Computer Science. 1990;Oxford University Press
12. Pfenning F., Elliott C. Higher-order abstract syntax. In Proceedings of the SIGPLAN'88 Conference on Programming Language Design and Implementation (SIGPLAN'88). June 1988;199-208 ACM Press
13. Pitts Andrew M. Some notes on inductive and co-inductive techniques in the semantics of functional programs. Notes Series BRICS-NS-94 - 5, BRICS, Department of Computer Science, University of Aarhus. December 1994
14. Sands D. Total correctness by local improvement in program transformation. In Conference Record of POPL '95: 22nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. January 1995;ACM Press, New York
15. Sands D. Total correctness by local improvement in the transformation of functional programs. ACM Transactions on Programming Languages and Systems (TOPLAS). 18:(2):March 1996;175-234. Extended version of [San95]
16. Sands D. From sos rules to proof principles: An operational metatheory for functional languages. In 24th ACM SIGPLAN-SIGACT Symposium on Principles on Programming Languages (POPL'97). 1997;ACM Press
17. Talcott C. Towards a theory of binding structures: An abstract algebra. Nivat Maurice, Rattray Charles, Rus Teodor, Scollo Giuseppe. Proceedings of the Second International Conference on Algebraic Methodology and Software Technology, Workshops in Computing. 1992;201-215 Springer Verlag, London. May22 - 25
18. Talcott C. A theory of binding structures and applications to rewriting. Theoretical Computer Science. 112:(1):April 1993;99-143
19. Talcott C. Reasoning about functions with effects. Gordon A., Pitts A. Higher-Order Operational Techniques in Semantics. 1988;Cambridge University Press