Results 1  10
of
423
Quantitative Types for Intuitionistic Calculi
"... Abstract. We define quantitative type systems for two intuitionistic term languages. While the first language in natural deduction style is already known in the literature, the second one is one of the contributions of the paper, and turns out to be a natural computational interpretation of sequent ..."
Abstract
 Add to MetaCart
Abstract. We define quantitative type systems for two intuitionistic term languages. While the first language in natural deduction style is already known in the literature, the second one is one of the contributions of the paper, and turns out to be a natural computational interpretation of sequent
OrderTheoretic, Geometric and Combinatorial Models of Intuitionistic S4 Proofs
 IN INTUITIONISTIC MODAL LOGICS AND APPLICATIONS (IMLA’99)
, 1999
"... We propose a few models of proof terms for the intuitionistic modal propositional logic S4. Some of them are based on partial orders, or cpos, or dcpos, some of them on a suitable category of topological spaces and continuous maps. A structure that emerges from these interpretations is that of augme ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
We propose a few models of proof terms for the intuitionistic modal propositional logic S4. Some of them are based on partial orders, or cpos, or dcpos, some of them on a suitable category of topological spaces and continuous maps. A structure that emerges from these interpretations
A Parigotstyle linear λcalculus for Full intuitionistic Linear Logic
, 2005
"... This paper describes a natural deduction formulation for Full Intuitionistic Linear Logic (FILL), an intriguing variation of multiplicative linear logic, due to Hyland and de Paiva. The system FILL resembles intuitionistic logic, in that all its connectives are independent, but resembles classical l ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
This paper describes a natural deduction formulation for Full Intuitionistic Linear Logic (FILL), an intriguing variation of multiplicative linear logic, due to Hyland and de Paiva. The system FILL resembles intuitionistic logic, in that all its connectives are independent, but resembles classical
COMMON FIXED POINT OF SELFMAPS IN INTUITIONISTIC FUZZY METRIC SPACES
"... Abstract. Intuitionistic fuzzy metric spaces have been defined by J.H. Park ([5]). Although topological structure of an intuitionistic fuzzy metric space (X,M,N, ∗,♦) coincides with the topological structure of the fuzzy metric space (X,M, ∗) ([2]), study of common fixed theory in intuitionistic fuz ..."
Abstract
 Add to MetaCart
Abstract. Intuitionistic fuzzy metric spaces have been defined by J.H. Park ([5]). Although topological structure of an intuitionistic fuzzy metric space (X,M,N, ∗,♦) coincides with the topological structure of the fuzzy metric space (X,M, ∗) ([2]), study of common fixed theory in intuitionistic
A Parigotstyle Linear lambdaCalculus for Full Intuitionistic Linear Logic
, 2003
"... This paper describes a natural deduction formulation for Full Intuitionistic Linear Logic (FILL), an intriguing variation of multiplicative linear logic, due to Hyland and de Paiva. The system FILL resembles intuitionistic logic, in that all its connectives are independent, but resembles classic ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper describes a natural deduction formulation for Full Intuitionistic Linear Logic (FILL), an intriguing variation of multiplicative linear logic, due to Hyland and de Paiva. The system FILL resembles intuitionistic logic, in that all its connectives are independent, but resembles
A PARIGOTSTYLE LINEAR λCALCULUS FOR FULL INTUITIONISTIC LINEAR LOGIC
"... Abstract. This paper describes a natural deduction formulation for Full Intuitionistic Linear Logic (FILL), an intriguing variation of multiplicative linear logic, due to Hyland and de Paiva. The system FILL resembles intuitionistic logic, in that all its connectives are independent, but resembles c ..."
Abstract
 Add to MetaCart
Abstract. This paper describes a natural deduction formulation for Full Intuitionistic Linear Logic (FILL), an intriguing variation of multiplicative linear logic, due to Hyland and de Paiva. The system FILL resembles intuitionistic logic, in that all its connectives are independent, but resembles
WHAT IS IN A STEP: A FULLYABSTRACT SEMANTICS FOR STATECHARTS MACRO STEPS Via Intuitionistic Kripke Models
"... The semantics of Statecharts macro steps, as introduced by Pnueli and Shalev, lacks compositionality. This report rst analyzes the compositionality problem and traces it back to the invalidity of the Law of the Excluded Middle. It then characterizes the semantics via a particular class of linear, i ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
, intuitionistic Kripke models, namely stabilization sequences. This yields, for the first time in the literature, a simple fullyabstract semantics which interprets Pnueli and Shalev's concept of failure naturally. The results not only give insight into the semantic subtleties of Statecharts, but also
A Relevant Analysis of Natural Deduction
 Journal of Logic and Computation
, 1999
"... Linear and other relevant logics have been studied widely in mathematical, philosophical and computational logic. We describe a logical framework, RLF, for defining natural deduction presentations of such logics. RLF consists in a language together, in a manner similar to that of Harper, Honsell and ..."
Abstract

Cited by 28 (7 self)
 Add to MetaCart
and an intuitionistic one. We study a natural deduction presentation of the type theory and establish the required prooftheoretic metatheory. The RLF framework is a conservative extension of LF. We show that RLF uniformly encodes (fragments of) intuitionistic linear logic, Curry's l I calculus and ML
Mechanized metatheory modelchecking
 In 9th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming
, 2007
"... The problem of mechanically formalizing and proving metatheoretic properties of programming language calculi, type systems, operational semantics, and related formal systems has received considerable attention recently. However, the dual problem of searching for errors in such formalizations has rec ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
received comparatively little attention. In this paper, we consider the problem of bounded modelchecking for metatheoretic properties of formal systems specified using nominal logic. In contrast to the current state of the art for metatheory verification, our approach is fully automatic, does not require
Adjoint Rewriting and the !type constructor
, 1996
"... This paper provides a sound, complete and decidable equational theory for the terms of the (I;\Omega ; \Gammaffi; !)fragment of intuitionistic linear logic with respect to the class of models known as linear categories. This work uses the natural deduction style presentation of the ! type constru ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
This paper provides a sound, complete and decidable equational theory for the terms of the (I;\Omega ; \Gammaffi; !)fragment of intuitionistic linear logic with respect to the class of models known as linear categories. This work uses the natural deduction style presentation of the ! type
Results 1  10
of
423