package coq-ltl
- Overview
- No Docs
You can search for identifiers within the package.
in-package search v0.2.0
Linear Temporal Logic
Install
Dune Dependency
Authors
Maintainers
Sources
v8.5.0.tar.gz
md5=4d24eb83fa1ca093dbe5af4701c79776
Description
This contribution contains a shallow embedding of Linear Temporal Logic (LTL) based on a co-inductive representation of program executions. Temporal operators are implemented as inductive (respectively co-inductive) types when they are least (respectively greatest) fixpoints. Several general lemmas, that correspond to LTL rules, are proved.
Tags
keyword:temporal logic keyword:infinite transition systems keyword:co-induction category:Mathematics/Logic/Modal logic date:2002-07Published: 07 Jun 2016
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
On This Page