U. de'Liguoro, A. Piperno  @ NUS Home/Search
Context
Related
| di.unito.it/~deligu/pub/dLP92.ps.gz Cached: PS.gz PS PDF Image Update Help From: di.unito.it/~deligu/pub/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper studies the interplay between functional application and nondeterministic choice in the context of untyped -calculus. We introduce an operational semantics which is based on the idea of must preorder, coming from the theory of process algebras. To characterize this relation, we build a model using the classical inverse limit construction, and we prove it fully abstract using a generalization of Bohm trees. (Update)
Active bibliography (related documents): More All
1.1: Non-Deterministic untyped λ-calculus - A study about.. - Liguoro (1991) (Correct)
1.0: Non Deterministic Extensions of Untyped λ-calculus - de'Liguoro, Piperno (1995) (Correct)
0.2: A Filter Model for Concurrent λ-Calculus - Dezani-Ciancaglini.. (1998) (Correct)
Similar documents based on text: More All
0.3: Filter Models for Conjunctive-Disjunctive.. - Dezani-Ciancaglini.. (Correct)
0.2: A Convex Powerdomain over Lattices: its Logic and.. - Alessi, al. (1997) (Correct)
0.2: Retractions of Types with Many Atoms - Regnier, Urzyczyn (2001) (Correct)
BibTeX entry: (Update)
@misc{ de'liguoro-must,
author = "U. de'Liguoro and A. Piperno",
title = "Must Preorder in Non-Deterministic Untyped λ-calculus",
url = "citeseer.comp.nus.edu.sg/668534.html" }
Citations (may not include all citations):729 The Lambda-Calculus: Its Syntax and Semantics (context) - Barendregt - 1984
194 Functions as Processes (context) - Milner - 1990
149 Testing Equivalences for Processes (context) - De Nicola, Hennessy - 1983
146 A Powerdomain Construction (context) - Plotkin - 1976
130 Full Abstraction in the Lazy Lambda Calculus (context) - Abramsky, Ong - 1989
118 Lambda Calculus Models of Programming Languages (context) - Morris - 1968
87 Notions of Computation and Monads - Moggi - 1991
77 Full Abstraction for a Simple Parallel Programming Language (context) - Hennessy, Plotkin - 1979
62 A Calculus of Higher-Order Communicating Systems (context) - Thomsen - 1989
59 The relation between computational and denotational properti.. (context) - Wadsworth - 1976
33 A Syntactic Characterization of the Equality in some Models .. (context) - Hyland - 1976
29 Lambda Calculus Models and Extensionality (context) - Hindley, Longo - 1980
26 Power Domains (context) - Smyth - 1978
21 Call-by-name, Call-by-value and the -calculus (context) - Plotkin - 1975
19 A mathematical Semantics for a Nondeterministic Typed Lambda.. (context) - Ashcroft, Hennessy - 1980
14 The Semantics of Call-by-value and Call-by-name in a nondete.. (context) - Hennessy - 1980
11 A Domain-theoretic Model for a Higher-order Process Calculus - Jagadeesan, Panangaden - 1990
9 A Lambda Calculus for Parallel Functions (context) - Boudol - 1990
7 Syntactic Aspects of the Non-deterministic Lambda Calculus (context) - Sharma - 1984
6 Alcune proprieta' delle forme fi-j-normali nel -K-calcolo (context) - Bohm - 1968
3 Semi)-separability of finite sets of terms in Scott's D1-mod.. (context) - Coppo, Dezani-Ciancaglini et al. - 1978
1 Non deterministic untyped -calculus (context) - de'Liguoro - 1991
1 Distributive Semantics for Nondeterministic Typed - calculi (context) - Astesiano, Costa - 1984
Documents on the same site (http://www.di.unito.it/~deligu/pub/): More
Non Deterministic Extensions of Untyped λ-calculus - de'Liguoro, Piperno (1995) (Correct)
A Convex Powerdomain over Lattices: its Logic and.. - Alessi, al. (1997) (Correct)
A Filter Model for Concurrent λ-Calculus - Dezani-Ciancaglini.. (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST at NUS Add search form to your site Submit documents Feedback
CiteSeer.IST at NUS - Copyright Penn State and NEC. Hosted by the School of Computing, National University of Singapore.