Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

ESOP

2009

Springer

2009

Springer

This paper studies inductive definitions involving binders, in which aliasing between free and bound names is permitted. Such aliasing occurs in informal specifications of operational semantics, but is excluded by the common representation of binding as meta-level ion. Drawing upon ideas from functional logic programming, we represent such definitions with aliasing as recursively defined functions in a higher-order typed functional programming language that extends core ML with types for name-binding, a type of "semi-decidable propositions" and existential quantification for types with decidable equality. We show that the representation is sound and complete with respect to the language's operational semantics, which combines the use of evaluation contexts with constraint programming. We also give a new and simple proof that the associated constraint problem is NP-complete.

Added |
16 Aug 2010 |

Updated |
16 Aug 2010 |

Type |
Conference |

Year |
2009 |

Where |
ESOP |

Authors |
Matthew R. Lakin, Andrew M. Pitts |

Comments (0)