16844 search results - page 299 / 3369 » How to Design Programs |
166
click to vote
ERLANG
2003
ACM
15 years 12 months ago
2003
ACM
This paper describes how the Erlang programming language could be extended with parameterized modules, in a way that is compatible with existing code. This provides a powerful way...
272
click to vote
POPL
1999
ACM
15 years 11 months ago
1999
ACM
hought of as abstract interpretation for the heap How we talk about the heap Program var X points to U that has an N field pointing to V We use first order predicate logic ¡...
134
click to vote
SAS
1994
Springer
15 years 10 months ago
1994
Springer
Abstract. Our aim is to study how the interpretive approach -- inserting an interpreter between a source program and a program specializer -- can be used to improve the transformat...
160
click to vote
ICALP
2000
Springer
15 years 10 months ago
2000
Springer
In this paper, we recall how the syntax of diagrams is captured by the diagram editor generator DIAGEN, and outline a visual, rule-based, and objectoriented programming language b...
187
click to vote
LANMR
2007
15 years 8 months ago
2007
Abstract We study the notion of strong equivalence between two disjunctive logic programs under the G3-stable model semantics, also called the P-stable semantics, and we show how s...