Alex Wright
Abstract
A novel approach to computational logic is reaching maturity, opening up opening up new vistas in programming languages, proof nets, and security applications.
- Abramsky, S., Jagadeesan, R., and Malacaria, P. Full abstraction for PCF (extended abstract). Lecture Notes in Computer Science 789, Proceedings of Conference on Theoretical Aspects of Computer Software, 1994. Google Scholar
Digital Library
- Bowers, K.D., Bauer, L., Garg, D., Pfenning, F., and Reiter, M.K. Consumable credentials in logic-based access-control systems. Proceedings of the 14th Annual Network and Distributed System Security Symposium, San Diego, CA, Feb. 28-March 2, 2007.Google Scholar
- Girard, J.-Y. Linear logic. Theoretical Computer Science 50, 1, 1987. Google ScholarDigital Library
- Lincoln, P., Mitchell, J., Scedrov, A., and Shankar, N. Decision problems for propositional linear logic. Proceedings of the 31st Annual Symposium on Foundations of Computer Science, St. Louis, MO, Oct. 22-24, 1990. Google ScholarDigital Library
- Miller, D. An overview of linear logic programming. Linear Logic in Computer Science, Ehrhard, T., Girard, J.-Y., Ruet, P., and Scott, P. (Eds.), Cambridge University Press, London, U.K. 2004.Google Scholar
Index Terms
- Linear logic
Recommendations
Constructive linear-time temporal logic: Proof systems and Kripke semantics
In this paper we study a version of constructive linear-time temporal logic (LTL) with the ''next'' temporal operator. The logic is originally due to Davies, who has shown that the proof system of the logic corresponds to a type system for binding-time ...
A Paraconsistent Linear-time Temporal Logic
Inconsistency-tolerant reasoning and paraconsistent logic are of growing importance not only in Knowledge Representation, AI and other areas of Computer Science, but also in Philosophical Logic. In this paper, a new logic, paraconsistent linear-time ...
Monadic concurrent linear logic programming
PPDP '05: Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programmingLolli 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 ...
Comments