Dynamic dependency pairs for algebraic functional systems

Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt

Standard

Dynamic dependency pairs for algebraic functional systems. / Kop, Cynthia Louisa Martina; van Raamsdonk, Femke.

I: Logical Methods in Computer Science, Bind 8, Nr. 2, 10, 2012.

Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt

Harvard

Kop, CLM & van Raamsdonk, F 2012, 'Dynamic dependency pairs for algebraic functional systems', Logical Methods in Computer Science, bind 8, nr. 2, 10.

APA

Kop, C. L. M., & van Raamsdonk, F. (2012). Dynamic dependency pairs for algebraic functional systems. Logical Methods in Computer Science, 8(2), [10].

Vancouver

Kop CLM, van Raamsdonk F. Dynamic dependency pairs for algebraic functional systems. Logical Methods in Computer Science. 2012;8(2). 10.

Author

Kop, Cynthia Louisa Martina ; van Raamsdonk, Femke. / Dynamic dependency pairs for algebraic functional systems. I: Logical Methods in Computer Science. 2012 ; Bind 8, Nr. 2.

Bibtex

@article{9dc23850737e490597edeb56d10ae810,
title = "Dynamic dependency pairs for algebraic functional systems",
abstract = "We extend the higher-order termination method of dynamic dependency pairs to Algebraic Functional Systems (AFSs). In this setting, simply typed lambda-terms with algebraic reduction and separate beta-steps are considered. For left-linear AFSs, the method is shown to be complete. For so-called local AFSs we define a variation of usable rules and an extension of argument filterings. All these techniques have been implemented in the higher-order termination tool WANDA.",
author = "Kop, {Cynthia Louisa Martina} and {van Raamsdonk}, Femke",
year = "2012",
language = "English",
volume = "8",
journal = "Logical Methods in Computer Science",
issn = "1860-5974",
publisher = "International Federation for Computational Logic",
number = "2",

}

RIS

TY - JOUR

T1 - Dynamic dependency pairs for algebraic functional systems

AU - Kop, Cynthia Louisa Martina

AU - van Raamsdonk, Femke

PY - 2012

Y1 - 2012

N2 - We extend the higher-order termination method of dynamic dependency pairs to Algebraic Functional Systems (AFSs). In this setting, simply typed lambda-terms with algebraic reduction and separate beta-steps are considered. For left-linear AFSs, the method is shown to be complete. For so-called local AFSs we define a variation of usable rules and an extension of argument filterings. All these techniques have been implemented in the higher-order termination tool WANDA.

AB - We extend the higher-order termination method of dynamic dependency pairs to Algebraic Functional Systems (AFSs). In this setting, simply typed lambda-terms with algebraic reduction and separate beta-steps are considered. For left-linear AFSs, the method is shown to be complete. For so-called local AFSs we define a variation of usable rules and an extension of argument filterings. All these techniques have been implemented in the higher-order termination tool WANDA.

M3 - Journal article

VL - 8

JO - Logical Methods in Computer Science

JF - Logical Methods in Computer Science

SN - 1860-5974

IS - 2

M1 - 10

ER -

ID: 148058703