Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
421721 | Electronic Notes in Theoretical Computer Science | 2014 | 28 Pages |
Abstract
We define the class of relational graph models and study the induced order- and equational- theories. Using the Taylor expansion, we show that all λ-terms with the same Böhm tree are equated in any relational graph model. If the model is moreover extensional and satisfies a technical condition, then its order-theory coincides with Morris's observational pre-order. Finally, we introduce an extensional version of the Taylor expansion, then prove that two λ-terms have the same extensional Taylor expansion exactly when they are equivalent in Morris's sense.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics