Sciweavers

499 search results - page 19 / 100
» Logic Programming in a Fragment of Intuitionistic Linear Log...
Sort
View
TACS
2001
Springer
15 years 8 months ago
Fixed-Point Logic with the Approximation Modality and Its Kripke Completeness
Abstract. We present two modal typing systems with the approximation modality, which has been proposed by the author to capture selfreferences involved in computer programs and the...
Hiroshi Nakano
ICFP
2005
ACM
16 years 4 months ago
Translating specifications from nominal logic to CIC with the theory of contexts
We study the relation between Nominal Logic and the Theory of Contexts, two approaches for specifying and reasoning about datatypes with binders. We consider a natural-deduction s...
Marino Miculan, Ivan Scagnetto, Furio Honsell
PPDP
1999
Springer
15 years 8 months ago
A Calculus for Interaction Nets
hemical abstract machine Shinya Sato Himeji Dokkyo University, Faculty of Econoinformatics, 7-2-1 Kamiohno, Himeji-shi, Hyogo 670-8524, Japan Ian Mackie LIX, CNRS UMR 7161, ´Ecole...
Maribel Fernández, Ian Mackie
LMCS
2007
132views more  LMCS 2007»
15 years 4 months ago
The Complexity of Model Checking Higher-Order Fixpoint Logic
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
Roland Axelsson, Martin Lange, Rafal Somla
CSL
2004
Springer
15 years 9 months ago
Structures for Multiplicative Cyclic Linear Logic: Deepness vs Cyclicity
The aim of this work is to give an alternative presentation for the multiplicative fragment of Yetter’s cyclic linear logic. The new presentation is inspired by the calculus of s...
Pietro Di Gianantonio