Use this URL to cite or link to this record in EThOS:
Title: Framework for binding operators
Author: Sun, Yong
Awarding Body: University of Edinburgh
Current Institution: University of Edinburgh
Date of Award: 1991
Availability of Full Text:
Access through EThOS:
Full text unavailable from EThOS. Please try the link below.
Access through Institution:
Binding appears in logic, programming and concurrency, e.g. it appears in Lambda Calculus, say the λ-abstraction. However, the binding in Lambda Calculus is unary. Certainly, we can generalize the idea of unary binding to an arbitrary finite numbers of binding. Algebraically, we can extend the framework of Universal Algebra and take arbitrary finite bindings as primitives. Therefore, operations in the new extended signature must be of second order instead of first order, and we name them as Binding Operators. The resulting framework is named as a Framework for Binding Operators, which coincides with Shapiro's diminished second order language. With a modification of Aczel's Frege Structure, we derive the algebras for Binding Operators, i.e. eBAs. The usual first order algebras, Plotkin's ω-model of Lambda Calculus, and Girard's qualitative domains turn out to be special cases of eBAs. And also eBAs turn out to be (i) a generalization of Kechris and Moschovakis' suitable class of functionals in Recursion in Higher Types and (ii) a generalized Volken's λ-family. Following Birkhoff, we would like to equationally characterize Binding Operators. Kechris and Moschovakis' Enumeration Theorem suggests that an algebraic characterization of such might be possible. Unfortunately, eBAs and the usual satisfaction modelseBA of Binding Equations over these eBAs, in Birkhoff's approach, do not work. Therefore, we have to find either a remedy for it or a new semantic model for Binding Operators. We will present two solutions, one for each. (a) For a remedy, we discover a condition for Birkhoff's approach to work. This condition is necessary and sufficient, and we call it an admissible condition, which turns out weaker than Plotkin's Logical Relations in the sense that 'logical' implies 'admissible'. An admissible equational calculus vdasheBA for Bindind Equations is obtained, whichis sound and complete wiyh respect to admissible satisfactionmodelseBA. The relationship between Completeness and Admissible Completeness (or between satisfaction modelseBA and admissible satisfaction modelseBA) is discussed, although it is not completely clear. Other problems remain open as well, say the closedness of direct products and the admissible variety problem. (b) For a new semantic model, we will give a new binding algebra, i.e. iBA, which is intensional in contrast to the previous (extensional) one. Actually, an iBA is a generalization of Friedman's Prestructures. A sound and complete equational calculus vdashiBA (in IBAs) is established. However, the derivability of vdashiBA is weaker than the one of vdasheBA. In other words, to share a same proof power with vdasheBA, vdashiBA has to use axiomatic schemas instead of pure axioms. Also, the relations between extensional modelseBA and intensional modelsiBA, and between admissible vdasheBA and intensional vdashiBA are discussed.
Supervisor: Not available Sponsor: Not available
Qualification Name: Thesis (Ph.D.) Qualification Level: Doctoral
EThOS ID:  DOI: Not available