Sciweavers

1302 search results - page 127 / 261
» Free-Style Theorem Proving
Sort
View
FBT
2000
167views Formal Methods» more  FBT 2000»
15 years 5 months ago
Diagrams for Dataflow
The behavior of reactive systems can be described by their black box properties as a relation between input and output streams. More operational is the behavior's description...
Max Breitling, Jan Philipps
ACL
1997
15 years 5 months ago
Maximal Incrementality in Linear Categorial Deduction
Recent work has seen the emergence of a common framework for parsing categorial grammar (CG) formalisms that fall within the 'type-logical' tradition (such as the Lambek...
Mark Hepple
ALC
1997
15 years 5 months ago
Predicative semantics of loops
A predicative semantics is a mapping of programs to predicates. These predicates characterize sets of acceptable observations. The presence of time in the observations makes the o...
Theodore S. Norvell
CADE
2010
Springer
15 years 5 months ago
Sledgehammer: Judgement Day
Abstract. Sledgehammer, a component of the interactive theorem prover Isabelle, finds proofs in higher-order logic by calling the automated provers for first-order logic E, SPASS a...
Sascha Böhme, Tobias Nipkow
GG
2008
Springer
15 years 5 months ago
Parallel and Sequential Independence for Borrowed Contexts
Parallel and sequential independence are central concepts in the concurrency theory of the double pushout (dpo) approach to graph rewriting. However, so far those same notions were...
Filippo Bonchi, Fabio Gadducci, Tobias Heindel