Sciweavers

756 search results - page 48 / 152
» Can Abstract State Machines Be Useful in Language Theory
Sort
View
TLDI
2010
ACM
218views Formal Methods» more  TLDI 2010»
14 years 4 months ago
Pointwise generalized algebraic data types
In the GADT (Generalized Algebraic Data Types) type system, a pattern-matching branch can draw type information from both the scrutinee type and the data constructor type. Even th...
Chuan-kai Lin, Tim Sheard
MODELS
2010
Springer
13 years 6 months ago
Embedded Software Development with Projectional Language Workbenches
This paper describes a novel approach to embedded software development. Instead of using a combination of C code and modeling tools, we propose an approach where modeling and progr...
Markus Voelter
ACSE
2000
ACM
14 years 10 days ago
Here, there and everywhere - on the recurring use of turtle graphics in CS1
The Logo programming language implements a virtual drawing machine—the turtle machine. The turtle machine is well-known for giving students an intuitive understanding of fundame...
Michael E. Caspersen, Henrik Bærbak Christen...
ICFP
2012
ACM
11 years 10 months ago
Introspective pushdown analysis of higher-order programs
In the static analysis of functional programs, pushdown flow analabstract garbage collection skirt just inside the boundaries of soundness and decidability. Alone, each method re...
Christopher Earl, Ilya Sergey, Matthew Might, Davi...
TSD
2010
Springer
13 years 5 months ago
Correlation Features and a Linear Transform Specific Reproducing Kernel
Abstract. In this paper we introduce two ideas for phoneme classification: First, we derive the necessary steps to integrate linear transform into the computation of reproducing ke...
Andreas Beschorner, Dietrich Klakow