Natural semantics and some of its meta-theory in Elf

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 596 LNAI, Issue , 1992, Pages 299-344

  Michaylov, Spiro ^a   Pfenning, Frank ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; DIFFERENTIATION (CALCULUS); HIGH LEVEL LANGUAGES; LOGIC PROGRAMMING; PROGRAM INTERPRETERS; RECURSIVE FUNCTIONS; SEMANTICS;

FUNCTION DEFINITIONS; FUNCTIONAL LANGUAGES; LOGICAL FRAMEWORKS; NATURAL SEMANTICS; OPERATIONAL SEMANTICS; SIMPLY TYPED LAMBDA CALCULUS; SUBJECT REDUCTION; TYPECHECKING;

COMPUTER CIRCUITS;

EID: 85029633298     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0013612     Document Type: Conference Paper

References (23)

1. Rod Burstall and Furio Honsell. A natural deduction treatment of operational semantics. In K. V. Nori and S. Kumar, editors, 8th Conference on Foundations of Software Technology and Theoretical Computer Science. Springer-Verlag LNCS 338, December 1988.
2. Alonzo Church. A formulation of the simple theory of types. Journal of Symbolic Logic, 5:56-68, 1940.
3. Dominique Clément, Joëlle Despeyroux, Thierry Despeyroux, and Gilles Kahn. A simple applicative language: Mini-ML. In Proceedings of the 1986 Conference on LISP and Functional Programming, pages 13-27. ACM Press, 1986.
4. Luis Damas and Robin Milner. Principal type schemes for functional programs. In Proceedings of the 9th ACM Symposium on Principles of Programming Languages, pages 207-212. ACM SIGPLAN/SIGACT, 1982.
5. Scott Dietzen and Frank Pfenning. A declarative alternative to assert in logic programming. In Vijay Saraswat and Kazunori Ueda, editors, International Logic Programming Symposium, pages 372-386. MIT Press, October 1991.
6. John Hannan. Investigating a Proof-Theoretic Meta-Language for Functional Programs. PhD thesis, University of Pennsylvania, January 1991. Available as MS-CIS-91-09.
7. John Hannan and Dale Miller. A meta-logic for functional programming. In H. Abramson and M. Rogers, editors, Meta-Programming in Logic Programming, chapter 24, pages 453-476. MIT Press, 1989.
8. John Hannan and Dale Miller. From operational semantics to abstract machines: Preliminary results. In M. Wand, editor, ACM Conference on Lisp and Functional Programming, pages 323-332. ACM Press, 1990.
9. John Hannan and Frank Pfenning. Compiler verification in LF. Submitted. Available as POP Report 91-03, School of Computer Science, Carnegie Mellon University, December 1991.
10. Robert Harper. Systems of polymorphic type assignment in LF. Technical Report CMU-CS-90-144, Carnegie Mellon University, Pittsburgh, Pennsylvania, June 1990.
11. Robert Harper, Furio Honsell, and Gordon Plotkin. A framework for defining logics. Journal of the ACM, To appear. A preliminary version appeared in Symposium on Logic in Computer Science, pages 194-204, June 1987.
12. Robert Harper and Frank Pfenning. Modularity in the LF logical framework. Submitted. Available as POP Report 91-01, School of Computer Science, Carnegie Mellon University, November 1991.
13. G. Kahn. Natural semantics. In Proceedings of the Symposium on Theoretical Aspects of Computer Science, pages 22-39. Springer-Verlag LNCS 247, 1987.
14. Spiro Michaylov and Frank Pfenning. Natural semantics and some of its metatheory in Elf. Technical Report MPI-I-91-211, Max-Planck-Institute for Computer Science, Saarbrücken, Germany, August 1991.
15. Dale Miller. Unification of simply typed lambda-terms as logic programming. In K. Furukawa, editor, Proceedings of the Eighth International Conference on Logic Programming, pages 255-269. MIT Press, July 1991.
16. Gopalan Nadathur and Dale Miller. An overview of AProlog. In Robert A. Kowalski and Kenneth A. Bowen, editors, Logic Programming: Proceedings of the Fifih International Conference and Symposium, Volume 1, pages 810-827, Cambridge, Massachusetts, August 1988. MIT Press.
17. Bengt Nordström, Kent Petersson, and Jan M. Smith. Programming in Martin-Löf’s Type Theory: An Introduction, volume 7 of International Series of Monographs on Computer Science. Oxford University Press, 1990.
18. Frank Pfenning. Elf: A language for logic definition and verified meta-programming. In Fourth Annual Symposium on Logic in Computer Science, pages 313-322. IEEE, June 1989.
19. Frank Pfenning. An implementation of the Elf core language in Standard ML. Available via tp over the Internet, September 1991. Send mail to elf-request@cs.cmu.edu for further information.
20. Frank Pfenning. Logic programming in the LF logical framework. In Gérard Huet and Gordon Plotkin, editors, Logical Frameworks, pages 149-181. Cambridge University Press, 1991.
21. Frank Pfenning and Conal Elliott. Higher-order abstract syntax. In Proceedings of the SIGPLAN '88 Symposium on Programming Language Design and Implementation, Atlanta, Georgia, pages 199-208. ACM Press, June 1988.
22. Frank Pfenning and Ekkehard Rohwedder. Implementing the meta-theory of deductive systems. Submitted. Available as POP Report 91-02, School of Computer Science, Carnegie Mellon University, November 1991.
23. Gordon D. Plotkin. A structural approach to operational semantics. Technical Report DAIMI FN-19, Computer Science Department, Aarhus University, Aarhus, Denmark, September 1981.