Sciweavers

438 search results - page 35 / 88
» On theorem proving in annotated logics
Sort
View
CADE
2005
Springer
16 years 6 months ago
Reasoning in Extensional Type Theory with Equality
Abstract. We describe methods for automated theorem proving in extensional type theory with primitive equality. We discuss a complete, cut-free sequent calculus as well as a compac...
Chad E. Brown
APAL
2005
89views more  APAL 2005»
15 years 5 months ago
Softness of hypercoherences and MALL full completeness
We prove a full completeness theorem for multiplicative-additive linear logic (i.e. MALL) using a double gluing construction applied to Ehrhard's -autonomous category of hype...
Richard Blute, Masahiro Hamano, Philip J. Scott
ICALP
2004
Springer
15 years 11 months ago
A Categorical Model for the Geometry of Interaction
We consider the multiplicative and exponential fragment of linear logic (MELL) and give a Geometry of Interaction (GoI) semantics for it based on unique decomposition categories. ...
Esfandiar Haghverdi, Philip J. Scott
ENTCS
2007
107views more  ENTCS 2007»
15 years 5 months ago
Event Domains, Stable Functions and Proof-Nets
We pursue the program of exposing the intrinsic mathematical structure of the “space of proofs” of a logical system [AJ94b]. We study the case of Multiplicative-Additive Linea...
Samson Abramsky
FAC
2010
106views more  FAC 2010»
15 years 3 months ago
Automatic verification of Java programs with dynamic frames
Framing in the presence of data abstraction is a challenging and important problem in the verification of object-oriented programs [LLM07]. The dynamic frames approach is a promisi...
Jan Smans, Bart Jacobs, Frank Piessens, Wolfram Sc...