Sciweavers

194 search results - page 6 / 39
» A Rewriting Semantics for Type Inference
Sort
View
TPHOL
2000
IEEE
13 years 11 months ago
Proving ML Type Soundness Within Coq
We verify within the Coq proof assistant that ML typing is sound with respect to the dynamic semantics. We prove this property in the framework of a big step semantics and also in ...
Catherine Dubois
CSL
2007
Springer
13 years 11 months ago
Comparing the Expressive Power of Well-Structured Transition Systems
We compare the expressive power of a class of well-structured transition systems that includes relational automata, Petri nets, lossy channel systems, and constrained multiset rewr...
Parosh Aziz Abdulla, Giorgio Delzanno, Laurent Van...
PODS
2010
ACM
249views Database» more  PODS 2010»
14 years 13 days ago
Semantic query optimization in the presence of types
Both semantic and type-based query optimization rely on the idea that queries often exhibit non-trivial rewritings if the state space of the database is restricted. Despite their ...
Michael Meier 0002, Michael Schmidt, Fang Wei, Geo...
FLOPS
2010
Springer
14 years 2 months ago
Code Generation via Higher-Order Rewrite Systems
Abstract. We present the meta-theory behind the code generation facilities of Isabelle/HOL. To bridge the gap between the source (higherorder logic with type classes) and the many ...
Florian Haftmann, Tobias Nipkow
ECOOP
2005
Springer
14 years 27 days ago
Towards Type Inference for JavaScript
Object-oriented scripting languages like JavaScript and Python are popular partly because of their dynamic features. These include the runtime modification of objects and classes ...
Christopher Anderson, Paola Giannini, Sophia Dross...