650 search results - page 106 / 130 » Logical Bisimulations and Functional Languages |
186
click to vote
ICLP
2009
Springer
16 years 1 months ago
2009
Springer
When a logic program is processed by an answer set solver, the first task is to generate its instantiation. In a recent paper, Calimeri et el. made the idea of efficient instantiat...
89
Voted
CADE
2006
Springer
16 years 22 days ago
2006
Springer
The nominal datatype package implements an infrastructure in Isabelle/HOL for defining languages involving binders and for reasoning conveniently about alpha-equivalence classes. P...
89
Voted
CADE
2004
Springer
16 years 22 days ago
2004
Springer
This paper is concerned with the integration of recursive data structures with Presburger arithmetic. The integrated theory includes a length function on data structures, thus prov...
70
Voted
FORMATS
2007
Springer
15 years 6 months ago
2007
Springer
We identify a class of timed automata, which we call counter-free input-determined automata, which characterize the class of timed languages definable by several timed temporal l...
95
Voted
DOCENG
2006
ACM
15 years 6 months ago
2006
ACM
For most users, authoring multimedia documents remains a complex task. One solution to deal with this problem is to provide template-based authoring tools but with the drawback of...