research-article

Temporal logic with "Until", functional reactive programming with processes, and concrete process categories

Author:

Wolfgang JeltschAuthors Info & Claims

PLPV '13: Proceedings of the 7th workshop on Programming languages meets program verification

Pages 69 - 78

https://doi.org/10.1145/2428116.2428128

Published: 22 January 2013 Publication History

Abstract

Recent research has revealed that the "always" and "eventually" operators from temporal logic correspond to the type constructors for behaviors and events from functional reactive programming (FRP). It is furthermore well-known that the "until" operators from LTL are generalizations of "always" and "eventually". In this paper, we show that behaviors and events can be generalized analogously. The result is a notion of process, which combines continuous and discrete aspects. We develop a common categorical semantics for an intuitionistic temporal logic with "until" and FRP with processes. This semantics reflects time-dependent trueness in temporal logic, time-dependent type inhabitance in FRP, and causality of FRP operations.

References

[1]

E. A. Emerson. Temporal and modal logic. In J. van Leeuwen, editor, phFormal Models and Semantics, volume B of Handbook of Theoretical Computer Science, pages 995--1072. MIT Press, Cambridge, Massachusetts, Jan. 1994. ISBN 978-0262720151.

Digital Library

[2]

G. Hager and J. Peterson. FROB: A transformational approach to the design of robot software. In J. M. Hollerbach and D. E. Koditschek, editors, Robotics Research: The Ninth International Symposium, pages 257--264. Springer, London, England, May 2000. ISBN 978--1852332921.

[3]

P. Hudak, A. Courtney, H. Nilsson, and J. Peterson. Arrows, robots, and functional reactive programming. In J. Jeuring and S. Peyton Jones, editors, Advanced Functional Programming, volume 2638 of Lecture Notes in Computer Science, pages 159--187. Springer, Berlin/Heidelberg, Germany, 2003. ISBN 978--3--540--40132--2. 10.1007/978--3--540--44833--4_6.

[4]

A. Jeffrey. LTL types FRP: Linear-time temporal logic propositions as types, proofs as functional reactive programs. In Proceedings of the Sixth Workshop on Programming Languages Meets Program Verification (PLPV'12), pages 49--60, New York, 2012. ACM. ISBN 978--1--4503--1125-0. 10.1145/2103776.2103783.

Digital Library

[5]

}jeltsch:programming-in-linear-temporal-logicW. Jeltsch. Programming in linear temporal logic. Slides of a talk given at the Computer Science Theory Seminar of the TTÜ Küberneetika Instituut, Feb. 2011 URL http://cs.ioc.ee/ tarmo/tsem10/jeltsch.html.

[6]

W. Jeltsch. The Curry--Howard correspondence between temporal logic and functional reactive programming. Slides of a talk given at the Estonian Computer Science Theory Days at Nelijärve, Feb. 2011. URL http://www.cs.ut.ee/varmo/tdaynelijarve/ettekanded.html.

[7]

W. Jeltsch. Towards a common categorical semantics for linear-time temporal logic and functional reactive programming. Electronic Notes in Theoretical Computer Science, 286: 229--242, Sept. 2012. ISSN 1571-0661. 10.1016/j.entcs.2012.08.015.

Digital Library

[8]

N. R. Krishnaswami and N. Benton. Ultrametric semantics of reactive programs. In Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science (LICS'11), pages 257--266, New York, June 2011. IEEE. ISBN 978--1--4577-0451--2. 10.1109/LICS.2011.38.

Digital Library

[9]

J. Lambek and P. J. Scott. phIntroduction to Higher-Order Categorical Logic. Number 7 in Cambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge, England, July 1988. ISBN 978-0521356534.

Digital Library

[10]

P. Maier. Intuitionistic LTL and a new characterization of safety and liveness. Technical Report MPI-I-2004--2-002, Max Planck Institut für Informatik, Saarbrücken, Germany, Aug. 2004. URL http://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/2004--2-002.

[11]

K. L. McMillan. Circular compositional reasoning about liveness. In L. Pierre and T. Kropf, editors, Correct Hardware Design and Verification Methods, volume 1703 of Lecture Notes in Computer Science, pages 342--346. Springer, London, England, 1999. ISBN 978--3--540--66559--5. 10.1007/3--540--48153--2_30.

Digital Library

[12]

K. S. Namjoshi and R. J. Trefler. On the completeness of compositional reasoning methods. ACM Transactions on Computational Logic, 11 (3): 16:1--16:22, May 2010. ISSN 1529--3785. 10.1145/1740582.1740584.

Digital Library

[13]

J. Peterson and G. Hager. Monadic robotics. In Proceedings of the 2nd Conference on Domain-Specific Languages (DSL'99), pages 95--108, New York, 1999. ACM. ISBN 1--58113--255--7. 10.1145/331960.331976.

Digital Library

[14]

J. Peterson, P. Hudak, and C. Elliott. Lambda in motion: Controlling robots with Haskell. In G. Gupta, editor, Practical Aspects of Declarative Languages, volume 1551 of Lecture Notes in Computer Science, pages 91--105. Springer, Berlin/Heidelberg, Germany, 1998. ISBN 978--3--540--65527--5. 10.1007/3--540--49201--1_7.

Digital Library

[15]

J. Peterson, G. Hager, and P. Hudak. A language for declarative robotic programming. In Proceedings of the 1999 IEEE International Conference on Robotics and Automation (ICRA'99), pages 1144--1151, New York, June 1999. IEEE. ISBN 0--7803--5180-0. 10.1109/ROBOT.1999.772516.

Cited By

Bahr PHoulborg ERørdam G(2024)Asynchronous Reactive Programming with Modal Types in HaskellPractical Aspects of Declarative Languages10.1007/978-3-031-52038-9_2(18-36)Online publication date: 10-Jan-2024
https://doi.org/10.1007/978-3-031-52038-9_2
Afshari BGrotenhuis LLeigh GZenger L(2023)Ill-Founded Proof Systems for Intuitionistic Linear-Time Temporal LogicAutomated Reasoning with Analytic Tableaux and Related Methods10.1007/978-3-031-43513-3_13(223-241)Online publication date: 14-Sep-2023
https://doi.org/10.1007/978-3-031-43513-3_13
O'Connor LWickström OJhala RDillig I(2022)Quickstrom: property-based acceptance testing with LTL specificationsProceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation10.1145/3519939.3523728(1025-1038)Online publication date: 9-Jun-2022
https://dl.acm.org/doi/10.1145/3519939.3523728
Show More Cited By

Index Terms

Temporal logic with "Until", functional reactive programming with processes, and concrete process categories

Recommendations

Functional reactive types
CSL-LICS '14: Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)

Functional Reactive Programming (FRP) is an approach to streaming data with a pure functional semantics as time-indexed values. In previous work, we showed that Linear-time Temporal Logic (LTL) can be used as a type system for discrete-time FRP, and ...
An abstract categorical semantics for functional reactive programming with processes
PLPV '14: Proceedings of the ACM SIGPLAN 2014 Workshop on Programming Languages meets Program Verification

Linear-time temporal logic and functional reactive programming (FRP) are related via a Curry-Howard correspondence. Thereby proofs of "always," "eventually," and "until" propositions correspond to behaviors, events, and processes, respectively. ...
Towards a Common Categorical Semantics for Linear-Time Temporal Logic and Functional Reactive Programming

Linear-time temporal logic (LTL) and functional reactive programming (FRP) are related via a Curry-Howard correspondence. Based on this observation, we develop a common categorical semantics for a subset of LTL and its corresponding flavor of FRP. We ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

PLPV '13: Proceedings of the 7th workshop on Programming languages meets program verification

January 2013

86 pages

ISBN:9781450318600

DOI:10.1145/2428116

Conference Chairs:
Matthew Might
University of Utah, USA
,
David Van Horn
Northeastern University, USA
,
General Chair:
Roberto Giacobazzi
Università di Verona, Italy
,
Program Chairs:
Andreas Abel
Ludwig-Maximilians-University Munich
,
Tim Sheard
Portland State University

Copyright © 2013 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGPLAN: ACM Special Interest Group on Programming Languages

In-Cooperation

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 22 January 2013

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

POPL '13

Sponsor:

SIGPLAN

POPL '13: The 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages

January 22, 2013

Rome, Italy

Acceptance Rates

PLPV '13 Paper Acceptance Rate 7 of 10 submissions, 70%;

Overall Acceptance Rate 18 of 25 submissions, 72%

Upcoming Conference

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

18
Total Citations
View Citations
148
Total Downloads

Downloads (Last 12 months)4
Downloads (Last 6 weeks)0

Reflects downloads up to 25 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Bahr PHoulborg ERørdam G(2024)Asynchronous Reactive Programming with Modal Types in HaskellPractical Aspects of Declarative Languages10.1007/978-3-031-52038-9_2(18-36)Online publication date: 10-Jan-2024
https://doi.org/10.1007/978-3-031-52038-9_2
Afshari BGrotenhuis LLeigh GZenger L(2023)Ill-Founded Proof Systems for Intuitionistic Linear-Time Temporal LogicAutomated Reasoning with Analytic Tableaux and Related Methods10.1007/978-3-031-43513-3_13(223-241)Online publication date: 14-Sep-2023
https://doi.org/10.1007/978-3-031-43513-3_13
O'Connor LWickström OJhala RDillig I(2022)Quickstrom: property-based acceptance testing with LTL specificationsProceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation10.1145/3519939.3523728(1025-1038)Online publication date: 9-Jun-2022
https://dl.acm.org/doi/10.1145/3519939.3523728
BAHR P(2022)Modal FRP for all: Functional reactive programming without space leaks in HaskellJournal of Functional Programming10.1017/S095679682200013232Online publication date: 26-Dec-2022
https://doi.org/10.1017/S0956796822000132
Spies SKrishnaswami NDreyer D(2021)Transfinite step-indexing for terminationProceedings of the ACM on Programming Languages10.1145/34342945:POPL(1-29)Online publication date: 4-Jan-2021
https://dl.acm.org/doi/10.1145/3434294
Bahr PGraulund CMøgelberg R(2021)Diamonds are not forever: liveness in reactive programming with guarded recursionProceedings of the ACM on Programming Languages10.1145/34342835:POPL(1-28)Online publication date: 4-Jan-2021
https://dl.acm.org/doi/10.1145/3434283
Graulund CSzamozvancev DKrishnaswami N(2021)Adjoint Reactive GUI ProgrammingFoundations of Software Science and Computation Structures10.1007/978-3-030-71995-1_15(289-309)Online publication date: 27-Mar-2021
https://dl.acm.org/doi/10.1007/978-3-030-71995-1_15
PEREZ INILSSON H(2020)Runtime verification and validation of functional reactive systemsJournal of Functional Programming10.1017/S095679682000021030Online publication date: 26-Aug-2020
https://doi.org/10.1017/S0956796820000210
Bahr PGraulund CMøgelberg R(2019)Simply RaTT: a fitch-style modal calculus for reactive programming without space leaksProceedings of the ACM on Programming Languages10.1145/33417133:ICFP(1-27)Online publication date: 26-Jul-2019
https://dl.acm.org/doi/10.1145/3341713
Perez INilsson H(2017)Testing and debugging functional reactive programmingProceedings of the ACM on Programming Languages10.1145/31102461:ICFP(1-27)Online publication date: 29-Aug-2017
https://dl.acm.org/doi/10.1145/3110246
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten