Nominal Unification of Higher Order Expressions with Recursive Let-Reference-Cited by-同舟云学术

Nominal Unification of Higher Order Expressions with Recursive Let

Published:2017 Issue: Volume: Page:328-344
ISSN:0302-9743
Container-title:Logic-Based Program Synthesis and Transformation
language:
Short-container-title:

Author:

Schmidt-Schauß Manfred,Kutsia Temur,Levy Jordi,Villaret Mateu

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-63139-4_19

Reference36 articles.

1. Aoto, T., Kikuchi, K.: A rule-based procedure for equivariant nominal unification. In: Informal Proceedings HOR, p. 5 (2016)

2. Ariola, Z.M., Felleisen, M., Maraist, J., Odersky, M., Wadler, P.: A call-by-need lambda calculus. In: POPL 1995, pp. 233–246. ACM Press, San Francisco (1995)

3. Ariola, Z.M., Klop, J.W.: Cyclic lambda graph rewriting. In: Proceedings of IEEE LICS, pp. 416–425. IEEE Press (1994)

4. Ayala-Rincón, M., de Carvalho-Segundo, W., Fernández, M., Nantes-Sobrinho, D.: A formalisation of nominal alpha-equivalence with A and AC function symbols. In: Proceedings of LSFA 2016, pp. 78–93 (2016)

5. Ayala-Rincón, M., Fernández, M., Nantes-Sobrinho, D.: Nominal narrowing. In: Pientka, B., Kesner, D. (eds.) Proceedings of First FSCD, pp. 11:1–11:17. LIPIcs (2016)

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

1. Nominal AC-Matching;Lecture Notes in Computer Science;2023

2. Unranked Nominal Unification;Lecture Notes in Computer Science;2022

3. Formalising nominal C-unification generalised with protected variables;Mathematical Structures in Computer Science;2021-03

4. Revisiting Graph Types in HyperLMNtal: A Modeling Language for Hypergraph Rewriting;IEEE Access;2021

5. Nominal Unification with Letrec and Environment-Variables;Logic-Based Program Synthesis and Transformation;2021