Unification for \(\lambda \)-calculi Without Propagation Rules

Conference paper

DOI: 10.1007/978-3-319-46750-4_11

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9965)
Cite this paper as:
de Moura F.L.C. (2016) Unification for \(\lambda \)-calculi Without Propagation Rules. In: Sampaio A., Wang F. (eds) Theoretical Aspects of Computing – ICTAC 2016. ICTAC 2016. Lecture Notes in Computer Science, vol 9965. Springer, Cham

Abstract

We present a unification procedure for calculi with explicit substitutions (ES) without propagation rules. The novelty of this work is that the unification procedure was developed for the calculi with ES that belong to the paradigm known as “act at a distance”, i.e. explicit substitutions are not propagated to the level of variables, as usual. The unification procedure is proved correct and complete, and enjoy a simple form of substitution, called grafting, instead of the standard capture avoiding variable substitution.

Copyright information

© Springer International Publishing AG 2016

Authors and Affiliations

  1. 1.Departamento de Ciência da ComputaçãoUniversidade de BrasíliaBrasíliaBrazil

Personalised recommendations