1154 search results - page 25 / 231 » Implementing Typed Intermediate Languages |
ICFP
2010
ACM
13 years 8 months ago
2010
ACM
Programmers reason about their programs using a wide variety of formal and informal methods. Programmers in untyped languages such as Scheme or Erlang are able to use any such met...
PLDI
2009
ACM
14 years 2 months ago
2009
ACM
Dynamic languages such as JavaScript are more difficult to compile than statically typed ones. Since no concrete type information is available, traditional compilers need to emit...
ICFP
2010
ACM
13 years 8 months ago
2010
ACM
Modern proof assistants such as Coq and Isabelle provide high degrees of expressiveness and assurance because they support formal reasoning in higher-order logic and supply explic...
EPIA
1989
Springer
13 years 11 months ago
1989
Springer
In this paper a model for temporal references in natural language (NL) is studied and a Prolog implementation of it is presented. This model is intended to be a common framework f...
CC
2000
Springer
13 years 12 months ago
2000
Springer
Mode-Automata have been proposed in [11]. They introduce, in the domain-specific data-flow language Lustre for reactive systems, a new construct devoted to the expression of runn...