Operational techniques in PVS - A preliminary evaluation

Electronic Notes in Theoretical Computer Science

Volumn 42, Issue , 2001, Pages 124-142

  Ford, Jonathan M ^a   Mason, Ian A ^a  

^a UNIVERSITY OF NEW ENGLAND   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTER OPERATING SYSTEMS; COMPUTER PROGRAMMING LANGUAGES; ENCODING (SYMBOLS); EVALUATION; LOGIC PROGRAMMING; SEMANTICS;

CHURCH-ROSSER THEOREM; DATA TYPES; LAMBDA CALCULUS; PROGRAMMING LOGICS;

PROGRAMMING THEORY;

EID: 0038687332     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80882-X     Document Type: Conference Paper

References (30)

1. Church A., Rosser J.B. Some properties of conversion. Transactions of the AMS. Volume 39:1936;472-482
2. J. Crow, S. Owre, J. Rushby, N. Shankar and M. Srivas. A Tutorial Introduction to PVS. Technical report, SRI International, 1995. Presented at WIFT '95: Workshop on Industrial-Strength Formal Specification Techniques, Boca Raton, Florida.
3. de Bruijn N.G. Lambda-Calculus Notation with Nameless Dummies: a Tool for Automatic Formula Manipulation with Application to the Church-Rosser Theorem. Indagationes Mathematicae. Volume 34:(Number 5):1972;381-392
4. J. Ford. The Church-Rosser theorem in PVS, 2000. PVS dump file (2.4 Megabytes) available at http://mcs.une.edu.au/~pvs/.
5. J. Ford and I. A. Mason. Establishing a General Context Lemma in PVS. In Proceedings of the 2nd Australasian Workshop on Computational Logic, AWCL'01, 2000. submitted.
6. R. Harper, H. Honsell and G. Plotkin. A framework for defining logics. In Second Annual Symposium on Logic in Computer Science. IEEE, 1987.
7. G. Huet. Residual Theory in λ-Calculus: A Formal Development. Technical Report 2009, INRIA, 1993.
8. Huet G. Residual Theory in λ-Calculus: A Formal Development. Journal of Functional Programming. Volume 4:(Number 3):1994;371-394. An earlier version appeared as [7]
9. Landin P.J. A correspondence between Algol60 and Church's lambda notation. Comm. ACM. Volume 8:1965;89-101. 158-165
10. I. A. Mason. Parametric Computation. In James Harland (editor), Proceedings of the Australasian Theory Symposium, CATS '97, pages 103-112, 1997.
11. Mason I.A. Computing with contexts. Higher-Order and Symbolic Computation. Volume 12:1999;171-201. An abridged version appears as [10]
12. I. A. Mason. A second glance at Feferman-Landin logic, 2000. Invited talk, HOOTS '00 Montreal, Canada, September 2000.
13. I. A. Mason and C. L. Talcott. Programming, transforming, and proving with function abstractions and memories. In Proceedings of the 16th EATCS Colloquium on Automata, Languages, and Programming, Stresa, Volume 372 of Lecture Notes in Computer Science, pages 574-588. Springer-Verlag, 1989.
14. Mason I.A., Talcott C.L. Equivalence in functional languages with effects. Journal of Functional Programming. Volume 1:1991;287-327
15. I. A. Mason and C. L. Talcott. Feferman-Landin Logic. In W. Sieg, R. Sommer and C. Talcott (editors), Reflections - A symposium honoring Solomon Feferman on his 70th birthday. to appear in Lecture Notes in Logic, 2000.
16. McKinna J., Pollack R. Pure Type Systems Formalized. Bezem M., Groote J.F. Typed Lambda Calculi and Applications, Volume 664 of Lecture Notes in Computer Science. 1993;289-305 Springer Verlag
17. McKinna J., Pollack R. Some Lambda Calculus and Type Theory Formalized. Journal of Automated Reasoning. Volume 23:1999;. An abridged version appeared as [16]
18. Milner R. Fully abstract models of typed λ-calculi. Theoretical Computer Science. Volume 4:1977;1-22
19. Nipkow T. More Church-Rosser Proofs (in Isabelle/HOL). McRobbie M., Slaney J.K. Automated Deduction - CADE-13, Volume 1104 of Lecture Notes in Computer Science. 1996;733-747 Springer Verlag
20. T. Nipkow. More Church-Rosser Proofs (in Isabelle/HOL), 2000. to appear in Journal of Automated Reasoning. An abridged version appears as [19].
21. F. Pfenning. A Proof of the Church-Rosser Theorem and its Representation in a Logical Framework. Technical Report CMU-CS-92-186, Carnegie Mellon University, 1992.
22. F. Pfenning. A Proof of the Church-Rosser Theorem and its Representation in a Logical Framework. Journal of Automated Reasoning (to appear), 2000. An earlier version appears as [21].
23. Plotkin G. Call-by-name, call-by-value and the lambda calculus. Theoretical Computer Science. Volume 1:1975;125-159
24. R Pollack. Polishing up the Tait-Martin-Löf Proof of the Church-Rosser Theorem. Unpublished note, available from ftp://ftp.cs.chalmers. se/pub/users/pollack/churchrosser.dvi.gz, 1995.
25. O. Rasmussen. The Church-Rosser theorem in Isabelle: A proof porting experiment. Technical Report 364, University of Cambridge, Computer Laboratory, 1995.
26. Shankar N. A Mechanical Proof of the Church-Rosser Theorem. Journal of the Association for Computing Machinery. Volume 35:(Number 3):1988;475-522
27. Shankar N. Metamathematics, Machines, and Göoüdel's Proof. 1994;Cambridge University Press
28. M. Sorensen and P. Urzyczyn. Lectures on the Curry-Howard Isomorphism. Technical Report 14, DIKU Report, 1998.
29. Takahashi M. Parallel reductions in the λ-calculus. Information and Computation. Volume 118:1995;120-127
30. Talcott C.L. Reasoning about functions with effects. Higher Order Operational Techniques in Semantics. 1996;Cambridge University Press