Abstract | ||
---|---|---|
An axiomatic version of the standardization theorem that shows the necessary basic properties between nesting of redexes and residuals is presented. This axiomatic approach provides a better understanding of standardization, and makes it applicable in other settings, such as directed acyclic graphs (dags) or interaction networks. conflicts between redexes are also treated. The axioms include stability in the sense given by G. Berry (Ph.D. thesis, Univ. of Paris, 1979), proving it to be an intrinsic notion of deterministic calculi |
Year | DOI | Venue |
---|---|---|
1992 | 10.1109/LICS.1992.185521 | LICS |
Keywords | Field | DocType |
interaction networks,deterministic calculi,redexes,residuals,formal logic,graph theory,axiomatic,standardization theorem,directed acyclic graphs,normal form,calculus,standardisation,arithmetic,top down,stability | Graph theory,Discrete mathematics,Graph,Combinatorics,Axiomatic system,Axiom,Computer science,Directed acyclic graph,Standardization | Conference |
Citations | PageRank | References |
34 | 1.89 | 3 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Georges Gonthier | 1 | 2275 | 195.06 |
Jean-jacques Lévy | 2 | 932 | 95.41 |
Paul-andré Melliès | 3 | 392 | 30.70 |