Sciweavers

212 search results - page 40 / 43
» Second-Order Simple Grammars
Sort
View
JUCS
2007
90views more  JUCS 2007»
15 years 3 months ago
High-level Structured Interactive Programs with Registers and Voices
Abstract: A model (consisting of rv-systems), a core programming language (for developing rv-programs), several specification and analysis techniques appropriate for modeling, pro...
Alexandru Popa, Alexandru Sofronia, Gheorghe Stefa...
116
Voted
STOC
2001
ACM
123views Algorithms» more  STOC 2001»
16 years 3 months ago
On optimal slicing of parallel programs
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
Markus Müller-Olm, Helmut Seidl
STOC
2010
ACM
216views Algorithms» more  STOC 2010»
16 years 23 days ago
The HOM problem is decidable
We close affirmatively a question which has been open for long time: decidability of the HOM problem. The HOM problem consists in determining, given a tree homomorphism D and a re...
Guillem Godoy, Omer Giménez, Lander Ramos and Car...
142
Voted
SAC
2009
ACM
15 years 10 months ago
Static type inference for Ruby
Many general-purpose, object-oriented scripting languages are dynamically typed, to keep the language flexible and not reject any programs unnecessarily. However, dynamic typing ...
Michael Furr, Jong-hoon (David) An, Jeffrey S. Fos...
144
Voted
PPDP
2007
Springer
15 years 9 months ago
Higher-order semantic labelling for inductive datatype systems
We give a novel transformation for proving termination of higher-order rewrite systems in the format of Inductive Data Type Systems (IDTSs) by Blanqui, Jouannaud and Okada. The tr...
Makoto Hamana