English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/156078
logo share SHARE logo core CORE   Add this article to your Mendeley library MendeleyBASE

Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:


Nominal Unification of Higher Order Expressions with Recursive Let

AuthorsSchmidt-Schauss, Manfred; Kutsia, Temur; Levy, Jordi ; Villaret, Mateu
KeywordsHigher-order expressions
Lambda calculus
Nominal unification
Operational semantics
Recursive let
Issue Date6-Sep-2016
Citation26th International Symposium on Logic-Based Program Synthesis and Transformation, LOPSTR 2016; LNCS 10184 (2017): 328-344
AbstractA sound and complete algorithm for nominal unification of higher-order expressions with a recursive let is described, and shown to run in non-deterministic polynomial time. We also explore specializations like nominal letrec-matching for plain expressions and for DAGs and determine their complexity. © Springer International Publishing AG 2017.
Identifiersdoi: 10.1007/978-3-319-63139-4_19
issn: 03029743
uri: https://arxiv.org/pdf/1608.03771v1.pdf
Appears in Collections:(IIIA) Comunicaciones congresos
Files in This Item:
File Description SizeFormat 
LOPSTR 2016_LNCS10184(328-44).pdf200,79 kBUnknownView/Open
Show full item record
Review this work

Related articles:

WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.