Automata, logic and games for the λ-calculus
<p>Automata, logic and games provide the mathematical theory that underpins the model checking of reactive systems:</p> <p>- automata on infinite words and trees as models of computation for statebased systems,</p> <p>- logical systems such as temporal and modal logics...
Main Author: | Ong, C |
---|---|
Format: | Conference item |
Published: |
Springer
2016
|
Similar Items
-
Games and Full Abstraction for the Lazy λ−calculus
by: Abramsky, S, et al.
Published: (1995) -
Full Abstraction in the Lazy λ−calculus
by: Abramsky, S, et al.
Published: (1993) -
The Lazy λ−Calculus
by: Abramsky, S
Published: (1990) -
Implicit automata in typed λ-calculi I: Aperiodicity in a non-commutative logic
by: Nguyễn, LTD, et al.
Published: (2020) -
The difference λ-calculus: a language for difference categories
by: Alvarez-Picallo, M, et al.
Published: (2020)