Sciweavers

378 search results - page 61 / 76
» Higher-order transformation of logic programs
Sort
View
ICSOFT
2007
13 years 8 months ago
Towards a New Code-Based Software Development Concept Enabling Code Patterns
Modern software development is driven by many critical forces. Among them are fast deployment requirements, a code base adaptable to new technologies, easy-to-maintain code, and lo...
Klaus Meffert, Ilka Philippow
SIGMOD
2006
ACM
122views Database» more  SIGMOD 2006»
14 years 7 months ago
The ADO.NET entity framework: making the conceptual level real
This paper describes the ADO.NET Entity Framework, a platform for programming against data that raises the level of ion from the logical (relational) level to the conceptual (enti...
Anil Nori, José A. Blakeley, S. Muralidhar
POPL
1998
ACM
13 years 11 months ago
From System F to Typed Assembly Language
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 ...
J. Gregory Morrisett, David Walker, Karl Crary, Ne...
POPL
2011
ACM
12 years 10 months ago
Dynamic inference of static types for ruby
There have been several efforts to bring static type inference to object-oriented dynamic languages such as Ruby, Python, and Perl. In our experience, however, such type inference...
Jong-hoon (David) An, Avik Chaudhuri, Jeffrey S. F...
JFP
2000
163views more  JFP 2000»
13 years 7 months ago
Automatic useless-code elimination for HOT functional programs
In this paper we present two type inference systems for detecting useless-code in higher-order typed functional programs. Type inference can be performed in an efficient and compl...
Ferruccio Damiani, Paola Giannini