Sciweavers

217 search results - page 19 / 44
» A New Approach to Abstract Syntax with Variable Binding
Sort
View
IEEECIT
2010
IEEE
13 years 7 months ago
Application of Concept Maps-based Anchored Instruction in Programming Course
—In need of interesting material and effective teaching approach in programming learning, students were ely to drop out of the course for the abstract concepts and complex struct...
Liu Li, Haijun Mao, Licheng Xu
VMCAI
2009
Springer
14 years 3 months ago
SubPolyhedra: A (More) Scalable Approach to Infer Linear Inequalities
Abstract. We introduce Subpolyhedra (SubPoly) a new numerical abstract domain to infer and propagate linear inequalities. SubPoly is as expressive as Polyhedra, but it drops some o...
Vincent Laviron, Francesco Logozzo
POPL
2010
ACM
14 years 6 months ago
Semantics and Algorithms for Data-dependent Grammars
Traditional parser generation technologies are incapable of handling the demands of modern programmers. In this paper, we present the design and theory of a new parsing engine, YA...
Yitzhak Mandelbaum, Trevor Jim, David Walker
FOSSACS
2005
Springer
14 years 2 months ago
Model Checking for Nominal Calculi
Nominal calculi have been shown very effective to formally model a variety of computational phenomena. The models of nominal calculi have often infinite states, thus making model ...
Gian Luigi Ferrari, Ugo Montanari, Emilio Tuosto
GPCE
2004
Springer
14 years 2 months ago
Taming Macros
Scheme includes a simple yet powerful macro mechanism. Using macros, programmers can easily extend the language with new kinds of expressions and definitions, thus abstracting ove...
Ryan Culpepper, Matthias Felleisen