3653 search results - page 316 / 731 » Learning of Partial Languages |
162
click to vote
FLOPS
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. Binding-time polymorphism enables a highly flexible bindingtime analysis for offline partial evaluation. This work provides the tools to translate this flexibility into...
193
Voted
CONCUR
1999
Springer
15 years 10 months ago
1999
Springer
We present several interpretations of the behavior of P/T nets in terms of traces, event structures, and partial orders. Starting from results of Hoogers, Kleijn and Thiagarajan, w...
180
click to vote
ICFEM
1998
Springer
15 years 10 months ago
1998
Springer
We show how familiar mathematical concepts from differential and integral calculus can be represented in the Z specification language. Digital computer systems involve hardware de...
127
click to vote
SAS
1994
Springer
15 years 10 months ago
1994
Springer
Abstract. Our aim is to study how the interpretive approach -- inserting an interpreter between a source program and a program specializer -- can be used to improve the transformat...
156
click to vote
FOCS
1995
IEEE
15 years 9 months ago
1995
IEEE
We prove that if strong pseudorandom number generators exist, then the class of languages that have polynomialsized circuits (P/poly) is not measurable within exponential time, in...