Sciweavers

3319 search results - page 20 / 664
» Subshifts, Languages and Logic
Sort
View
TCS
2011
14 years 7 months ago
Realizability models and implicit complexity
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
Ugo Dal Lago, Martin Hofmann
119
Voted
IGPL
2011
14 years 3 months ago
Generalized ordinal sums and translations
We extend the lattice embedding of the axiomatic extensions of the positive fragment of intuitionistic logic into the axiomatic extensions of intuitionistic logic to the setting of...
Nikolaos Galatos
PLDI
2011
ACM
14 years 3 months ago
Separation logic + superposition calculus = heap theorem prover
Program analysis and verification tools crucially depend on the ability to symbolically describe and reason about sets of program behaviors. Separation logic provides a promising...
Juan Antonio Navarro Pérez, Andrey Rybalche...
104
Voted
IJCAI
1993
15 years 1 months ago
A Language for Implementing Arbitrary Logics
SEQUEL is a new-generation functional programming language, which allows the specification of types in a notation based on the sequent calculus. The sequent calculus notation suff...
Mark Tarver
133
Voted
AAMAS
2011
Springer
14 years 4 months ago
Declarative programming for agent applications
This paper introduces the execution model of a declarative programming language intended for agent applications. Features supported by the language include functional and logic pro...
John W. Lloyd, Kee Siong Ng