Free ∑-monoids: A higher-order syntax with metavariables

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

Volumn 3302, Issue , 2004, Pages 348-363

  Hamana, Makoto ^a  

^a GUNMA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

BINS; CALCULATIONS; COMPUTATIONAL LINGUISTICS; DIFFERENTIATION (CALCULUS); SYNTACTICS;

ALGEBRAIC MODELING; CONCRETE SYSTEM; FREE CONSTRUCTION; HIGHER-ORDER; LAMBDA CALCULUS; METAVARIABLES; TERM LANGUAGES; VARIABLE BINDING;

ALGEBRA;

EID: 35048822580     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30477-7_23     Document Type: Article

References (15)

1. [FPT99] M. Fiore, G. Plotkin, and D. Turi. Abstract syntax and variable binding. In Proc. 14th Annual Symposium on Logic in Computer Science, pages 193-202, 1999.
2. [GU03] N. Ghani and T. Uustalu. Explicit substitutions and higher order syntax. In Proceedings of 2nd ACM SIGPLAN Workshop on Mechanized Reasoning about Languages with Variable Binding, MERLIN'03, pages 135-146, 2003.
3. [Ham01] M. Hamana. A logic programming language based on binding algebras. In 4th International Symposium on Theoretical Aspects of Computer Software (TACS 2001), LNCS 2215, pages 243-262, 2001.
4. [Ham03] M. Hamana. Term rewriting with variable binding: An initial algebra approach. In Fifth ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming (PPDP2003). ACM Press, 2003.
5. [HO01] M. Hashimoto and A. Ohori. A typed context calculus. Theoretical Computer Science, 266:249-271, 2001.
6. [Mac71] S. Mac Lane. Categories for the Working Mathematician, volume 5 of Graduate Texts in Mathematics. Springer-Verlag, New York, 1971.
7. [Mas99] Ian A. Mason. Computing with contexts. Higher-Order and Symbolic Computation, 12(2):171-201, 1999.
8. [Pit03] A. M. Pitts. Nominal logic, a first order theory of names and binding. Information and Computation, 186:165-193, 2003.
9. [Plo00] G. Plotkin. Another meta-language for programming with bound names modulo renaming. In Winter Workshop in Logics, Types and Rewriting, Heriot-Watt University, February 2000. Lecture slides.
10. [San98] D. Sands. Computing with contexts: A simple approach. In Second Workshop on Higher-Order Operational Techniques in Semantics (HOOTS II), volume 10 of Electronic Notes in Theoretical Computer Science, 1998.
11. [SSB99] M. Sato, T. Sakurai, and R. Burstall. Explicit environments. In In Proceedings of TLCA'99, LNCS 1581, pages 340-354, 1999.
12. [SSK01] M. Sato, T. Sakurai, and Y. Kameyama. A simply typed context calculus with first-class environments. In 5th International Symposium on Functional and Logic Programming (FLOPS 2001), LNCS 2024, pages 359-374, 2001.
13. [SSKI03] M. Sato, T. Sakurai, Y. Kameyama, and A. Igarashi. Calculi of metavariables. In Computer Science Logic and 8th Kurt Gödel Colloquium (CSL'03 & KGC), LNCS 2803, pages 484-497, 2003.
14. [Tal93] C. L. Talcott. A theory of binding structures and applications to rewriting. Theoretical Computer Science, 112(1):99-143, 1993.
15. [UPG03] C. Urban, A. M. Pitts, and M. J. Gabbay. Nominal unification. In Computer Science Logic and 8th Kurt Gödel Colloquium (CSL'03 & KGC), LNCS 2803, pages 513-527, 2003.