Lolli is a logic programming language based on the asynchronous propositions of intuitionistic linear logic. It uses a backward chaining, backtracking operational semantics. In this paper we extendâ€¦ (More)

When Miller introduced Forum he called it a speci cation logic rather than a logic programming language In this paper we outline those features that create problems in attempting to implement anâ€¦ (More)

We present an encoding of full linear lambda calculus in Haskell using higher order abstract syntax. By making use of promoted data kinds, multi-parameter type classes and functional dependencies,â€¦ (More)

Types are often used to control and analyze computer programs. Intersection types give a type system great flexibility, but have been difficult to implement. The ! operator, used to distinguishâ€¦ (More)

We present a system of natural deduction and associated term calculus for intuitionistic non-commutative linear logic (INCLL) as a conservative extension of intuitionistic linear logic. We proveâ€¦ (More)

We present a system of natural deduction and associated term calculus for intuitionistic non-commutative linear logic (INCLL) as a conservative extension of intuitionistic linear logic. We proveâ€¦ (More)

We begin with a review of intuitionistic non-commutative linear logic (INCLL), a re nement of linear logic with an inherent notion of order proposed by the authors in prior work. We then develop aâ€¦ (More)

We propose the monadic linear logic programming language LolliMon as a new foundation for the specification of distributed trust management systems, particularly the RT framework. LolliMon possessesâ€¦ (More)

We begin with a review of ordered linear logic (OLL), a renement of intuitionistic linear logic with an inherent notion of order. We then develop a logic programming interpretation for OLL in twoâ€¦ (More)