Paper Info
Title
Proof Net Semantics of Proof Search Computation
Abstract
We present a sound and complete compositional semantics, structured around certain abstractions of proof nets, for proof-search computation in a linear logic-based language. The model captures the interaction of agents in terms of the actions they engage into and of the dynamic creation of names. The model is adequate for reasoning about a notion of operational equivalence. We will also suggest how a partial order semantics can be derived from the present approach.
Year
DOI
Venue
1997
10.1007/BFb0027011
ALP/HOA
Keywords
Field
DocType
proof search computation,linear logic
Operational semantics,Computer science,Denotational semantics,Structural proof theory,Sequent calculus,Proof theory,Algorithm,Theoretical computer science,Linear logic,Well-founded semantics,Distributed computing,Proof net
Conference
ISBN
Citations 
PageRank 
3-540-63459-2
1
0.62
References 
Authors
12
2
Name
Order
Citations
PageRank
Luís Caires1103763.30
Luís Monteiro212619.98