Sciweavers

365 search results - page 7 / 73
» Using Types as Approximations for Type Checking Prolog Progr...
Sort
View
ICFP
2002
ACM
14 years 7 months ago
A demand-driven adaptive type analysis
Compilers for dynamically and statically typed languages ensure safe execution by verifying that all operations are performed on appropriate values. An operation as simple as car ...
Danny Dubé, Marc Feeley
PLDI
2010
ACM
14 years 18 days ago
Mixing type checking and symbolic execution
Static analysis designers must carefully balance precision and efficiency. In our experience, many static analysis tools are built around an elegant, core algorithm, but that alg...
Yit Phang Khoo, Bor-Yuh Evan Chang, Jeffrey S. Fos...
SAC
2009
ACM
14 years 6 days ago
SWOBE - embedding the semantic web languages RDF, SPARQL and SPARUL into java for guaranteeing type safety, for checking the sat
The Semantic Web and its technologies become increasingly important. As more and more Semantic Web applications are being used, developing more stable Semantic Web applications be...
Sven Groppe, Jana Neumann, Volker Linnemann
PPDP
2010
Springer
13 years 6 months ago
Generic record combinators with static type checking
Common record systems only provide access to individual record fields. However, it is often useful to have generic record combinators, that is, functions that work with complete ...
Wolfgang Jeltsch
ELP
1991
13 years 11 months ago
Natural Semantics and Some of Its Meta-Theory in Elf
Operational semantics provide a simple, high-level and elegant means of specifying interpreters for programming languages. In natural semantics, a form of operational semantics, p...
Spiro Michaylov, Frank Pfenning