Sciweavers

4666 search results - page 383 / 934
» Equations on Timed Languages
Sort
View
181
Voted
JAIR
2010
131views more  JAIR 2010»
15 years 5 months ago
Automatic Induction of Bellman-Error Features for Probabilistic Planning
Domain-specific features are important in representing problem structure throughout machine learning and decision-theoretic planning. In planning, once state features are provide...
Jia-Hong Wu, Robert Givan
170
Voted
ICFP
2001
ACM
16 years 6 months ago
Contification Using Dominators
Contification is a compiler optimization that turns a function that always returns to the same place into a continuation. Compilers for functional languages use contification to e...
Matthew Fluet, Stephen Weeks
191
Voted
VL
2009
IEEE
126views Visual Languages» more  VL 2009»
16 years 1 months ago
A graphical approach for modeling time-dependent behavior of DSLs
Domain specific languages (DSLs) play a cornerstone Model-Driven Software Development. The abstract syntax of a DSL is usually defined by a metamodel, while inplace model transf...
José Eduardo Rivera, Francisco Durán...
184
Voted
IFIP
2004
Springer
16 years 7 days ago
Dynamic Typing with Dependent Types
Dependent type systems are promising tools programmers can use to increase the reliability and security of their programs. Unfortunately, dependently-typed programming languages re...
Xinming Ou, Gang Tan, Yitzhak Mandelbaum, David Wa...
179
Voted
PADO
2001
Springer
15 years 11 months ago
Type Systems for Useless-Variable Elimination
nt Abstractions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 63 J¨orgen Gustavsson, Josef Svenningsson Implementing Circularity Using Pa...
Adam Fischbach, John Hannan