Sciweavers

756 search results - page 26 / 152
» Can Abstract State Machines Be Useful in Language Theory
Sort
View
POPL
2007
ACM
14 years 8 months ago
Generative unbinding of names
This paper is concerned with a programming language construct for typed name binding that enforces -equivalence. It proves a new result about what operations on names can co-exist...
Andrew M. Pitts, Mark R. Shinwell
ESOP
1998
Springer
14 years 4 days ago
Mode-Automata: About Modes and States for Reactive Systems
Abstract. In the eld of reactive system programming, data ow synchronous languages like Lustre BCH+85,CHPP87 or Signal GBBG85 o er a syntax similar to block-diagrams, and can be e ...
Florence Maraninchi, Yann Rémond
ICGI
2010
Springer
13 years 9 months ago
Grammatical Inference Algorithms in MATLAB
Although MATLAB1 has become one of the mainstream languages for the machine learning community, there is still skepticism among the Grammatical Inference (GI) community regarding t...
Hasan Ibne Akram, Colin de la Higuera, Huang Xiao,...
UPP
2004
Springer
14 years 1 months ago
From Prescriptive Programming of Solid-State Devices to Orchestrated Self-organisation of Informed Matter
Abstract. Achieving real-time response to complex, ambiguous, highbandwidth data is impractical with conventional programming. Only the narrow class of compressible input-output ma...
Klaus-Peter Zauner
CICLING
2008
Springer
13 years 10 months ago
Dynamic Translation Memory: Using Statistical Machine Translation to Improve Translation Memory Fuzzy Matches
Abstract. Professional translators of technical documents often use Translation Memory (TM) systems in order to capitalize on the repetitions frequently observed in these documents...
Ergun Biçici, Marc Dymetman