Sciweavers

1154 search results - page 140 / 231
» Implementing Typed Intermediate Languages
Sort
View
CADE
2001
Springer
15 years 10 months ago
More On Implicit Syntax
Proof assistants based on type theories, such as Coq and Lego, allow users to omit subterms on input that can be inferred automatically. While those mechanisms are well known, ad-h...
Marko Luther
SIGSOFT
2009
ACM
15 years 10 months ago
Fitting the pieces together: a machine-checked model of safe composition
Programs of a software product line can be synthesized by composing features which implement a unit of program functionality. In most product lines, only some combination of featu...
Benjamin Delaware, William R. Cook, Don S. Batory
CHI
2004
ACM
15 years 10 months ago
A commonsense approach to predictive text entry
People cannot type as fast as they think, especially when faced with the constraints of mobile devices. There have been numerous approaches to solving this problem, including rese...
Tom Stocky, Alexander Faaborg, Henry Lieberman
POPL
2002
ACM
15 years 10 months ago
Adaptive functional programming
An adaptive computation maintains the relationship between its input and output as the input changes. Although various techniques for adaptive computing have been proposed, they r...
Umut A. Acar, Guy E. Blelloch, Robert Harper
EUROCAST
2007
Springer
122views Hardware» more  EUROCAST 2007»
15 years 1 months ago
Generation of Indexes for Compiling Efficient Parsers from Formal Specifications
abstract Parsing schemata [4] provide a formal, simple and uniform way to describe, analyze and compare different parsing algorithms. The notion of a parsing schema comes from cons...
Carlos Gómez-Rodríguez, Miguel A. Al...