Functional reactive programming (FRP) is a paradigm extending functional languages with primitives which operate on state. Typical FRP systems contain many dozens of such primitives. This thesis aims to identify a minimal subset of primitives which captures the same set of behavior as these systems, and to provide an axiomatic semantics for them using first-order linear temporal logic, with the aim of utilizing these semantics in formal verification of FRP programs. Furthermore, we identify several important properties of these primitives and prove that they are satisfied using the Coq proof assistant.

Creator

• King, Christopher T.

Contributors

• Fisler, Kathryn

Degree

• MS

Unit

• Computer Science

Publisher

• Worcester Polytechnic Institute

Language

• English

Identifier

• etd-042908-133033

Keyword

• coq
• monads
• formal verification
• functional reactive programming

Advisor

• Fisler, Kathryn

Defense date

• 2008-05-04

Year

• 2008

Date created

• 2008-04-29

Resource type

• Thesis

Rights statement

• In Copyright

Last modified

• 2020-11-23