Sciweavers

192 search results - page 32 / 39
» Computer Assisted Grammar Construction
Sort
View
CADE
2001
Springer
14 years 7 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
ICWS
2009
IEEE
14 years 4 months ago
Mobile In-store Personalized Services
: © Mobile In-Store Personalized Services Jun Li, Ismail Ari, Jhilmil Jain, Alan H. Karp, Mohamed; Dekhil HP Laboratories HPL-2009-48 mobile shopping assistant, cross-organization...
Jun Li, Ismail Ari, Jhilmil Jain, Alan H. Karp, Mo...
PLDI
2010
ACM
13 years 11 months ago
Bringing Extensibility to Verified Compilers
Verified compilers, such as Leroy's CompCert, are accompanied by a fully checked correctness proof. Both the compiler and proof are often constructed with an interactive proo...
Zachary Tatlock, Sorin Lerner
PLDI
2009
ACM
14 years 8 months ago
Chameleon: adaptive selection of collections
Languages such as Java and C#, as well as scripting languages like Python, and Ruby, make extensive use of Collection classes. A collection implementation represents a fixed choic...
Ohad Shacham, Martin T. Vechev, Eran Yahav
TLDI
2009
ACM
111views Formal Methods» more  TLDI 2009»
14 years 4 months ago
A generic type-and-effect system
Type-and-effect systems are a natural approach for statically reasoning about a program’s execution. They have been used to track a variety of computational effects, for example...
Daniel Marino, Todd D. Millstein