Sciweavers

14 search results - page 1 / 3
» Efficient and Flexible Matching of Recursive Types
Sort
View
LICS
2000
IEEE
13 years 9 months ago
Efficient and Flexible Matching of Recursive Types
Equality and subtyping of recursive types have been studied in the 1990s by Amadio and Cardelli; Kozen, Palsberg, and Schwartzbach; Brandt and Henglein; and others. Potential appl...
Jens Palsberg, Tian Zhao
SIGMOD
2004
ACM
156views Database» more  SIGMOD 2004»
14 years 5 months ago
Tree Logical Classes for Efficient Evaluation of XQuery
XML is widely praised for its flexibility in allowing repeated and missing sub-elements. However, this flexibility makes it challenging to develop a bulk algebra, which typically ...
Stelios Paparizos, Yuqing Wu, Laks V. S. Lakshmana...

Book
301views
15 years 3 months ago
Programming in Standard ML
"Standard ML is a type-safe programming language that embodies many innovative ideas in programming language design. It is a statically typed language, with an extensible type...
Robert Harper
CGA
2004
13 years 5 months ago
Flexible Point-Based Rendering on Mobile Devices
Point-based rendering is a compact and efficient means of displaying complex geometry. Our goal is to enable flexible point-based rendering, permitting local image refinement, req...
Florent Duguet, George Drettakis
APLAS
2010
ACM
13 years 5 months ago
Amortized Resource Analysis with Polymorphic Recursion and Partial Big-Step Operational Semantics
This paper studies the problem of statically determining upper bounds on the resource consumption of first-order functional programs. A previous work approached the problem with an...
Jan Hoffmann 0002, Martin Hofmann