University of Cambridge > > Semantics Lunch (Computer Laboratory) > Resolving inductive definitions with binders

Resolving inductive definitions with binders

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Sam Staton.

We study 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 lambda-abstraction. 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 briefly discuss the associated constraint problem, which is NP-complete, and outline a constraint solving algorithm.

This talk is part of the Semantics Lunch (Computer Laboratory) series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2023, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity