Sciweavers

660 search results - page 80 / 132
» The Implicit Calculus of Constructions
Sort
View
COLING
1992
15 years 2 months ago
Compiling and Using Finite-State Syntactic Rules
A language-independent framework for syntactic finlte-state parsing is discussed. The article presents a framework, a formalism, a compiler and a parser for grammars written in th...
Kimmo Koskenniemi, Pasi Tapanainen, Atro Voutilain...
95
Voted
CORR
2008
Springer
112views Education» more  CORR 2008»
15 years 27 days ago
Canonical calculi with (n,k)-ary quantifiers
Propositional canonical Gentzen-type systems, introduced in [2], are systems which in addition to the standard axioms and structural rules have only logical rules in which exactly ...
Arnon Avron, Anna Zamansky
116
Voted
TCS
2008
15 years 22 days ago
Polyhedra genus theorem and Euler formula: A hypermap-formalized intuitionistic proof
This article presents formalized intuitionistic proofs for the polyhedra genus theorem, the Euler formula and a sufficient condition of planarity. They are based on a hypermap mod...
Jean-François Dufourd
102
Voted
TCS
2010
14 years 11 months ago
Alternating states for dual nondeterminism in imperative programming
The refinement calculus of Back, Morgan, Morris, and others is based on monotone predicate transformers (weakest preconditions) where conjunctions stand for demonic choices betwee...
Wim H. Hesselink
115
Voted
CADE
2012
Springer
13 years 3 months ago
Playing Hybrid Games with KeYmaera
We propose a new logic, called differential dynamic game logic (dDGL), that adds several game constructs on top of differential dynamic logic (dL) so that it can be used for hybr...
Jan-David Quesel, André Platzer