Sciweavers

678 search results - page 93 / 136
» A simple typed intermediate language for object-oriented lan...
Sort
View
TAGT
1994
Springer
185views Graph Theory» more  TAGT 1994»
14 years 23 days ago
Concatenation of Graphs
An operation of concatenation is introduced for graphs. Then strings are viewed as expressions denoting graphs, and string languages are interpreted as graph languages. For a clas...
Joost Engelfriet, Jan Joris Vereijken
VLDB
2006
ACM
207views Database» more  VLDB 2006»
14 years 9 months ago
Modeling and querying moving objects in networks
: Moving Objects Databases have become an important research issue in recent years. For and querying moving objects, there exists a comprehensive framework of abstract data types t...
Ralf Hartmut Güting, Victor Teixeira de Almeida, ...
POPL
1994
ACM
14 years 23 days ago
Formally Optimal Boxing
An important implementation decision in polymorphically typed functional programming languages is whether to represent data in boxed or unboxed form and when to transform them fro...
Fritz Henglein, Jesper Jørgensen
POPL
2001
ACM
14 years 9 months ago
Oracle-based checking of untrusted software
We present a variant of Proof-Carrying Code (PCC) in which the trusted inference rules are represented as a higher-order logic program, the proof checker is replaced by a nondeter...
George C. Necula, Shree Prakash Rahul
ICFP
2007
ACM
14 years 8 months ago
Call-pattern specialisation for haskell programs
User-defined data types, pattern-matching, and recursion are ubiquitous features of Haskell programs. Sometimes a function is called with arguments that are statically known to be...
Simon L. Peyton Jones