1154 search results - page 99 / 231 » Implementing Typed Intermediate Languages |
ISSTA
2004
ACM
15 years 3 months ago
2004
ACM
Constraints in predicate or relational logic can be translated into boolean logic and solved with a SAT solver. For faster solving, it is common to exploit the typing of predicate...
HASKELL
2008
ACM
14 years 11 months ago
2008
ACM
We present Haskell libraries that statically ensure the safe use of resources such as file handles. We statically prevent accessing an already closed handle or forgetting to clos...
110
click to vote
SIGADA
2005
Springer
15 years 3 months ago
2005
Springer
Concerns for concurrent systems are not always easy to modularize within single units using traditional programming languages. The concept of aspect orientation can be applied to ...
GPCE
2005
Springer
15 years 3 months ago
2005
Springer
Previous work on semantics-based multi-stage programming (MSP) language design focused on homogeneous designs, where the generating and the generated languages are the same. Homoge...
IFIP
2004
Springer
15 years 3 months ago
2004
Springer
A term terminates if all its reduction sequences are of finite length. We show four type systems that ensure termination of well-typed π-calculus processes. The systems are obtai...