Sciweavers

815 search results - page 117 / 163
» Algebraic Recognizability of Languages
Sort
View
TPHOL
2005
IEEE
15 years 5 months ago
Alpha-Structural Recursion and Induction
The nominal approach to abstract syntax deals with the issues of bound names and α-equivalence by considering constructions and properties that are invariant with respect to permu...
Andrew M. Pitts
APLAS
2005
ACM
15 years 5 months ago
Calculating Polynomial Runtime Properties
Affine size-change analysis has been used for termination analysis of eager functional programming languages. The same style of analysis is also capable of compactly recording and ...
Hugh Anderson, Siau-Cheng Khoo, Stefan Andrei, Bea...
PPDP
2000
Springer
15 years 3 months ago
Declarative event-oriented programming
Events play an important role in the construction of most software that involves interaction or simulation. Typically, programmers make use of a fixed set of low level events supp...
Conal Elliott
ENTCS
2008
120views more  ENTCS 2008»
14 years 12 months ago
Specifying and Executing Reactive Scenarios With Lutin
This paper presents the language Lutin and its operational semantics. This language specifically targets the domain of reactive systems, where an execution is a (virtually) infini...
Pascal Raymond, Yvan Roux, Erwan Jahier
ECEASST
2006
96views more  ECEASST 2006»
14 years 12 months ago
Optimizing Pattern Matching Compilation by Program Transformation
Motivated by the promotion of rewriting techniques and their use in major industrial applications, we have designed Tom: a pattern matching layer on top of conventional programming...
Emilie Balland, Pierre-Etienne Moreau