Sciweavers

824 search results - page 21 / 165
» Constructing Functional Programs for Grammar Analysis Proble...
Sort
View
GCSE
1999
Springer
14 years 22 days ago
Scoping Constructs for Software Generators
Abstract. A well-known problem in program generation is scoping. When identifiers (i.e., symbolic names) are used to refer to variables, types, or functions, program generators mu...
Yannis Smaragdakis, Don S. Batory
PADO
2001
Springer
14 years 27 days ago
Implementing Circularity Using Partial Evaluation
Complex data dependencies can often be expressed concisely by defining a variable in terms of part of its own value. Such a circular reference can be naturally expressed in a lazy...
Julia L. Lawall
CERA
2002
134views more  CERA 2002»
13 years 8 months ago
Graph Grammar Based Product Family Modeling
: Many industries are shifting from mass production to mass customization, which demands quick response to the needs of individual customers with high quality and low costs. The de...
Xuehong Du, Jianxin Jiao, Mitchell M. Tseng
ENTCS
2006
125views more  ENTCS 2006»
13 years 8 months ago
Estimating the Cost of Native Method Calls for Resource-bounded Functional Programming Languages
We address the problem of applying resource-bounded functional programming languages in practice on object-oriented virtual machines which include calls to native methods coded in...
Stephen T. Gilmore, Olha Shkaravska
ERSHOV
1989
Springer
14 years 15 days ago
Experiments with Implementations of Two Theoretical Constructions
This paper reports two experiments with implementations of constructions from theoretical computer science. The first one deals with Kleene’s and Rogers’ second recursion the...
Torben Amtoft Hansen, Thomas Nikolajsen, Jesper La...