MULTILISP: a language for concurrent symbolic computation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Higher-order logic programming
Proceedings on Third international conference on logic programming
Theoretical Computer Science
The family of concurrent logic programming languages
ACM Computing Surveys (CSUR)
LO and behold! Concurrent structured processes
OOPSLA/ECOOP '90 Proceedings of the European conference on object-oriented programming on Object-oriented programming systems, languages, and applications
Notions of computation and monads
Information and Computation
The essence of functional programming
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Logic programming in a fragment of intuitionistic linear logic
Papers presented at the IEEE symposium on Logic in computer science
Forum: a multiple-conclusion specification logic
ALP Proceedings of the fourth international conference on Algebraic and logic programming
Information and Computation
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
On the complexity analysis of static analyses
Journal of the ACM (JACM)
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
A New Meta-complexity Theorem for Bottom-Up Logic Programs
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Handbook of automated reasoning
A judgmental reconstruction of modal logic
Mathematical Structures in Computer Science
Model checking linear logic specifications
Theory and Practice of Logic Programming
CONCUR 2005 - Concurrency Theory
Specifying distributed trust management in LolliMon
Proceedings of the 2006 workshop on Programming languages and analysis for security
Expressing heap-shape contracts in linear logic
Proceedings of the 5th international conference on Generative programming and component engineering
Electronic Notes in Theoretical Computer Science (ENTCS)
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Celf --- A Logical Framework for Deductive and Concurrent Systems (System Description)
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Algorithmic specifications in linear logic with subexponentials
PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
Static analysis, abstract interpretation and verification in (constraint logic) programming
A 25-year perspective on logic programming
Proof-theoretic and higher-order extensions of logic programming
A 25-year perspective on logic programming
Testing concurrent systems: an interpretation of intuitionistic logic
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
A linear logic of authorization and knowledge
ESORICS'06 Proceedings of the 11th European conference on Research in Computer Security
ILC: a foundation for automated reasoning about pointer programs
ESOP'06 Proceedings of the 15th European conference on Programming Languages and Systems
Logical approximation for program analysis
Higher-Order and Symbolic Computation
Linear logical voting protocols
VoteID'11 Proceedings of the Third international conference on E-Voting and Identity
Linear-Logic Based Analysis of Constraint Handling Rules with Disjunction
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
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 Lolli with the remaining connectives of intuitionistic linear logic restricted to occur inside a monad, an idea taken from the concurrent logical framework (CLF). The resulting language, called LolliMon, has a natural forward chaining, committed choice operational semantics inside the monad, while retaining Lolli's semantics outside the monad. LolliMon thereby cleanly integrates both concurrency and saturation with logic programming search. We illustrate its expressive power through several examples including an implementation of the pi-calculus, a call-by-need lambda-calculus, and several saturating algorithms presented in logical form.