Constructive linear-time temporal logic: Proof systems and Kripke semantics

Authors:
Kensuke Kojima;Atsushi Igarashi
Affiliations:
Graduate School of Informatics, Kyoto University, Kyoto 606-8501, Japan;Graduate School of Informatics, Kyoto University, Kyoto 606-8501, Japan
Venue:
Information and Computation
Year:
2011

Citing 17
Cited 2

Partial evaluation and automatic program generation

Partial evaluation and automatic program generation
Modal and temporal logics

Handbook of logic in computer science (vol. 2)
Monad as modality

NSL '94 Proceedings of the first workshop on Non-standard logics and logical aspects of computer science
Propositional lax logic

Information and Computation
Structural cut elimination

Information and Computation
MetaML and multi-stage programming with explicit annotations

Theoretical Computer Science - Partial evaluation and semantics-based program manipulation
A modal analysis of staged computation

Journal of the ACM (JACM)
Environment classifiers

POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Efficient Multi-level Generating Extensions for Program Specialization

PLILPS '95 Proceedings of the 7th International Symposium on Programming Languages: Implementations, Logics and Programs
Categorical and Kripke Semantics for Constructive S4 Modal Logic

CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
An Idealized MetaML: Simpler, and More Expressive

ESOP '99 Proceedings of the 8th European Symposium on Programming Languages and Systems
A temporal-logic approach to binding-time analysis

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
A Symmetric Modal Lambda Calculus for Distributed Computing

LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Staged computation with names and necessity

Journal of Functional Programming
A polymorphic modal type system for lisp-like multi-staged languages

Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A modal type system for multi-level generating extensions with persistent code

Proceedings of the 8th ACM SIGPLAN international conference on Principles and practice of declarative programming
A monadic multi-stage metalanguage

FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software

LTL types FRP: linear-time temporal logic propositions as types, proofs as functional reactive programs

PLPV '12 Proceedings of the sixth workshop on Programming languages meets program verification
Fair reactive programming

Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 analysis via the Curry-Howard isomorphism. However, he did not investigate the logic itself in detail; he has proved only that the logic augmented with negation and classical reasoning is equivalent to (the ''next'' fragment of) the standard formulation of classical linear-time temporal logic. We give natural deduction, sequent calculus and Hilbert-style proof systems for constructive LTL with conjunction, disjunction and falsehood, and show that the sequent calculus enjoys cut elimination. Moreover, we also consider Kripke semantics and prove soundness and completeness. One distinguishing feature of this logic is that distributivity of the ''next'' operator over disjunction ''@?(A@?B)@?@?A@?@?B'' is rejected in view of a type-theoretic interpretation.