Sciweavers

3827 search results - page 323 / 766
» The Epsilon Generation Language
Sort
View
SYNASC
2005
IEEE
86views Algorithms» more  SYNASC 2005»
16 years 7 days ago
One and Two Polarizations, Membrane Creation and Objects Complexity in P Systems
We improve, by using register machines, some existing universality results for specific models of P systems. P systems with membrane creation are known to generate all recursivel...
Artiom Alhazov, Rudolf Freund, Agustin Riscos-N&ua...
POPL
2004
ACM
16 years 7 months ago
Parsing expression grammars: a recognition-based syntactic foundation
For decades we have been using Chomsky's generative system of grammars, particularly context-free grammars (CFGs) and regular expressions (REs), to express the syntax of prog...
Bryan Ford
ICFP
2003
ACM
16 years 6 months ago
FreshML: programming with binders made simple
FreshML extends ML with elegant and practical constructs for declaring and manipulating syntactical data involving statically scoped binding operations. User-declared FreshML data...
Mark R. Shinwell, Andrew M. Pitts, Murdoch Gabbay
VEE
2009
ACM
146views Virtualization» more  VEE 2009»
16 years 1 months ago
Demystifying magic: high-level low-level programming
r of high-level languages lies in their abstraction over hardware and software complexity, leading to greater security, better reliability, and lower development costs. However, o...
Daniel Frampton, Stephen M. Blackburn, Perry Cheng...
DLT
2007
15 years 8 months ago
Duplication Roots
Recently the duplication closure of words and languages has received much interest. We investigate a reversal of it: the duplication root reduces a word to a square-free one. After...
Peter Leupold