641 search results - page 65 / 129 » Embedding Finite Sets in a Logic Programming Language |
172
Voted
POPL
2010
ACM
16 years 25 days ago
2010
ACM
We introduce higher-order, multi-parameter, tree transducers (HMTTs, for short), which are kinds of higher-order tree transducers that take input trees and output a (possibly infi...
126
Voted
POPL
2010
ACM
16 years 25 days ago
2010
ACM
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
256
Voted
POPL
2006
ACM
16 years 3 months ago
2006
ACM
We define a type system, which may also be considered as a simple Hoare logic, for a fragment of an assembly language that deals with code pointers and jumps. The typing is aimed ...
155
Voted
EUSAI
2007
Springer
15 years 5 months ago
2007
Springer
Developing applications for smart spaces is a challenging task. Most programming systems narrowly focus on the embedded computer infrastructure and neglect the spatial aspect of th...
125
click to vote
ESOP
2003
Springer
15 years 8 months ago
2003
Springer
In complex systems, like robot plants, applications are built on top of a set of components, or devices. Each of them has particular individual constraints, and there are also log...