A logic programming language based on binding algebras

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

Volumn 2215, Issue , 2001, Pages 243-262

  Hamana, Makoto ^a  

^a GUNMA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ADA (PROGRAMMING LANGUAGE); COMPUTER SOFTWARE; FORMAL LOGIC; LOGIC PROGRAMMING; SEMANTICS;

ALPHA-CONVERSION; FIRST ORDER; FIRST ORDER LOGIC; HIGHER-ORDER; LAMBDA TERMS; OPERATIONAL SEMANTICS; SLD RESOLUTION; UNIFICATION ALGORITHMS;

COMPUTER CIRCUITS;

EID: 84979086822     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45500-0_12     Document Type: Conference Paper

References (12)

1. [dB72] N. de Bruijn. Lambda clculus notation with nameless dummies, a tool for automatic formula manipulation, whith application to the church-rosser theorem. Indagationes Mathematicae, 34: 381-391, 1972.
2. [DFH95] J. Despeyroux, A. Felty, and A. Hirschowitz. Higher-order abstract syntax in Coq. In M. Dezani and G. Plotkin, editors, Typed Lambda Clculi and Apllications, LNCS 902, pages 124-138, 1995.
3. [FPT99] M. Fiore, G. Plotkin, and D. Turi. Abstrat syntax and variable binding. In 14th Annual Symposium on Logic in Computer Science, pages 193-202, Washington, 1999. IEEE Computer Society Press.
4. [GP99] M. J. Gabbay and A. M. Pitts. A new approach to abstract syntax involving binders. In 14th Annual Symposium on Logic in Computer Science, pages 214-224, Washington, 1999. IEEE Computer Society Press.
5. [Hof99] M. Hofmann. Seman tical analysis of higher-order abstract syntax. In 14th Annual Symposium on Logic in Computer Science, pages 204-213, Washington, 1999. IEEE Computer Society Press.
6. [Mil91] D. Miller. A logic programming language with lambda-abstraction, function variables, and simple unification,. Journal of Logic and Computation, 1(4): 497-536, 1991.
7. [Mil00] D. Miller. Abstract syntax for variable binders: An overview. In John Lloyd, et. al., editor, Proceedings of Computation Logic 2000, LNAI 1861, 2000.
8. [MM82] A. Martelli and U. Montanari. An efficient unification algorithm. ACM Transactions of Programming Languages, 4(2): 258-282, 1982.
9. [NM88] G. Nadathur and D. Miller. An overview of λProlog. In Fifth International Logic Programming Conference, pages 810-827. MIT Press, 1988.
10. [Oho96] A. Ohori. A typed context calculus. In Preprint RIMS-1098. Research Institute for Mathematical Sciences, Kyoto University, 1996.
11. [PG00] A. M. Pitts and M. J. Gabbay. A metalanguage for programming with bound names modulo renaming. In R. Bac khouse and J. N. Oliv eira, editors, Mathematics of Program Construction, MPC2000, Proceedings, Ponte de Lima, Portugal, July 2000, volume 1837 of Lecture Notes in Computer Science, pages 230-255. Springer-V erlag, Heidelberg, 2000.
12. [SSK01] M. Sato, T. Sakurai, and Y. Kameyama. A simply typed context calculu with first-class environments. In 5th International Symposium on Functional and Logic Programming, volume LNCS 2024, pages 359-374, 2001.