391 search results - page 44 / 79 » Automatic programming with semantic streams |
POPL
1998
ACM
15 years 3 months ago
1998
ACM
abstractions, such as closures, tuples, and user-defined abstract data types. The type system ensures that well-typed programs cannot violate these abstractions. In addition, the ...
SIGADA
2004
Springer
15 years 4 months ago
2004
Springer
Refactoring is a technique for restructuring code to improve its design. A tool for automatically applying refactoring transformations to Ada 95 programs is described. The tool is...
AAAI
2006
15 years 11 days ago
2006
The Situation Calculus and the Fluent Calculus are successful action formalisms that share many concepts. But until now there is no formal relation between the two calculi that wo...
117
click to vote
PEPM
1993
ACM
15 years 3 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...
118
click to vote
TOOLS
1992
IEEE
15 years 3 months ago
1992
IEEE
This paper describes an Ei el system for rapid testing of grammars. Grammars are de ned in an extended BNF notation that allows actions on the parse tree nodes to be de ned as add...