3736 search results - page 368 / 748 » Generative Programming |
123
click to vote
ESOP
1999
Springer
15 years 9 months ago
1999
Springer
MetaML is a multi-stage functional programming language featuring three constructs that can be viewed as statically-typed refinements of the back-quote, comma, and eval of Scheme....
165
click to vote
PEPM
1993
ACM
15 years 8 months ago
1993
ACM
The aim of binding-time analysis is to determine when variables, expressions, statements, etc. in a program can be evaluated by classifying these into static (compile-time) and dy...
147
click to vote
ERLANG
2007
ACM
15 years 8 months ago
2007
ACM
We propose a small extension of the ERLANG language that allows programmers to specify contracts with type information at the level of individual functions. Such contracts are opt...
147
click to vote
ESOP
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. General refinement types allow types to be refined by predicates written in a general-purpose programming language, and can express function pre- and postconditions and d...
137
click to vote
ACSC
2004
IEEE
15 years 8 months ago
2004
IEEE
This paper introduces a repeatable and constructive approach to the analysis of loop progress and termination conditions in imperative programs. It is applicable to all loops for ...