Results 1 
7 of
7
Safe recursion with higher types and BCKalgebra
 Annals of Pure and Applied Logic
, 2000
"... In previous work the author has introduced a lambda calculus SLR with modal and linear types which serves as an extension of BellantoniCook's function algebra BC to higher types. It is a step towards a functional programming language in which all programs run in polynomial time. In this paper ..."
Abstract

Cited by 24 (3 self)
 Add to MetaCart
(Show Context)
In previous work the author has introduced a lambda calculus SLR with modal and linear types which serves as an extension of BellantoniCook's function algebra BC to higher types. It is a step towards a functional programming language in which all programs run in polynomial time. In this paper we develop a semantics of SLR using BCKalgebras consisting of certain polynomialtime algorithms. It will follow from this semantics that safe recursion with arbitrary result type built up from N and ( as well as recursion over trees and other data structures remains within polynomial time. In its original formulation SLR supported only natural numbers and recursion on notation with first order functional result type. 1 Introduction In [10] and [11] we have introduced a lambda calculus SLR which generalises the BellantoniCook characterisation of PTIME [2] to higherorder functions. The separation between normal and safe variables which is crucial to the BellantoniCook system has been achieved...
Unified Semantics for Modality and lambdaterms via Proof Polynomials
"... It is shown that the modal logic S4, simple calculus and modal calculus admit a realization in a very simple propositional logical system LP , which has an exact provability semantics. In LP both modality and terms become objects of the same nature, namely, proof polynomials. The provability inte ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
It is shown that the modal logic S4, simple calculus and modal calculus admit a realization in a very simple propositional logical system LP , which has an exact provability semantics. In LP both modality and terms become objects of the same nature, namely, proof polynomials. The provability interpretation of modal terms presented here may be regarded as a systemindependent generalization of the CurryHoward isomorphism of proofs and terms. 1 Introduction The Logic of Proofs (LP , see Section 2) is a system in the propositional language with an extra basic proposition t : F for "t is a proof of F ". LP is supplied with a formal provability semantics, completeness theorems and decidability algorithms ([3], [4], [5]). In this paper it is shown that LP naturally encompasses calculi corresponding to intuitionistic and modal logics, and combinatory logic. In addition, LP is strictly more expressive because it admits arbitrary combinations of ":" and propositional connectives. The id...
Logic Column 9
, 2000
"... this article is to survey this development beginning from Cobham's 1965 result which was the rst in the area, up to the current research frontier. ..."
Abstract
 Add to MetaCart
(Show Context)
this article is to survey this development beginning from Cobham's 1965 result which was the rst in the area, up to the current research frontier.
Semantical analysis of higherorder abstract syntax
"... It is the aim of this paper to advocate the use of functor categories as a semantic foundation of higherorder abstract syntax (HOAS). By way of example, we will showhow functor categories can be used for at least the following applications: ..."
Abstract
 Add to MetaCart
(Show Context)
It is the aim of this paper to advocate the use of functor categories as a semantic foundation of higherorder abstract syntax (HOAS). By way of example, we will showhow functor categories can be used for at least the following applications:
Semantical Analysis of HigherOrder Syntax
 In 14th Annual Symposium on Logic in Computer Science
, 1999
"... this paper to advocate the use of functor categories as a semantic foundation of higherorder abstract syntax (HOAS). By way of example, we will show how functor categories can be used for at least the following applications: ..."
Abstract
 Add to MetaCart
this paper to advocate the use of functor categories as a semantic foundation of higherorder abstract syntax (HOAS). By way of example, we will show how functor categories can be used for at least the following applications: