Sciweavers

1999 search results - page 171 / 400
» Dependently Typed Grammars
Sort
View
CADE
2010
Springer
15 years 7 months ago
Analytic Tableaux for Higher-Order Logic with Choice
Abstract. While many higher-order interactive theorem provers include a choice operator, higher-order automated theorem provers currently do not. As a step towards supporting autom...
Julian Backes, Chad E. Brown
GG
2008
Springer
15 years 7 months ago
High-Level Programs and Program Conditions
High-level conditions are well-suited for expressing structural properties. They can describe the precondition and the postcondition for a high-level program, but they cannot descr...
Karl Azab, Annegret Habel
ICFP
2010
ACM
15 years 7 months ago
Total parser combinators
A monadic parser combinator library which guarantees termination of parsing, while still allowing many forms of left recursion, is described. The library's interface is simil...
Nils Anders Danielsson
ICFP
2010
ACM
15 years 7 months ago
The gentle art of levitation
We present a closed dependent type theory whose inductive types are given not by a scheme for generative declarations, but by encoding in a universe. Each inductive datatype arise...
James Chapman, Pierre-Évariste Dagand, Cono...
HAPTICS
2010
IEEE
15 years 6 months ago
Online Intention Recognition in Computer-Assisted Teleoperation Systems
Limitations of state-of-the-art teleoperation systems can be compensated by using shared-control teleoperation architectures that provide haptic assistance to the human operator. T...
Nikolay Stefanov, Angelika Peer, Martin Buss