αProlog: A Logic Programming Language with Names, Binding and α-Equivalence-Reference-Cited by-同舟云学术

αProlog: A Logic Programming Language with Names, Binding and α-Equivalence

Published:2004 Issue: Volume: Page:269-283
ISSN:0302-9743
Container-title:Logic Programming
language:
Short-container-title:

Author:

Cheney James,Urban Christian

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-27775-0_19.pdf

Reference26 articles.

1. Electronic Notes in Theoretical Computer Science;A. Andreas,2001

2. Lecture Notes in Computer Science;J. Cheney,2004

3. de Bruijn, N.G.: Lambda-calculus notation with nameless dummies, a tool for automatic formula manipulation. Indag. Mat. 34(5), 381–392 (1972)

4. Lecture Notes in Computer Science;J. Despeyroux,1995

5. Fiore, M.P., Plotkin, G.D., Turi, D.: Abstract syntax and variable binding. In: Proc. 14th Symp. on Logic in Computer Science (LICS 1999), pp. 193–202. IEEE, Los Alamitos (1999)

Cited by 52 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Approaching Model Edition as a Linear Logic Problem;2023 ACM/IEEE International Conference on Model Driven Engineering Languages and Systems Companion (MODELS-C);2023-10-01

2. Unification Modulo Equational Theories in Languages with Binding Operators (Invited Talk);Logic-Based Program Synthesis and Transformation;2023

3. A Survey of the Proof-Theoretic Foundations of Logic Programming;Theory and Practice of Logic Programming;2021-11-18

4. DBRG: Description-Based Non-Quality Requirements Generator;2021 IEEE 29th International Requirements Engineering Conference (RE);2021-09

5. Nominal Equational Problems;Lecture Notes in Computer Science;2021