Sciweavers

3653 search results - page 222 / 731
» On Recognizable Timed Languages
Sort
View
CORR
1999
Springer
70views Education» more  CORR 1999»
15 years 6 months ago
Restart Strategies and Internet Congestion
We recently presented a methodology to quantitatively reduce the average time and variance in the time required to execute electronic transactions in a network environment such as...
Sebastian M. Maurer, Bernardo A. Huberman
ICFP
2001
ACM
16 years 7 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
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...
IFIP
2004
Springer
16 years 17 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...
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