3319 search results - page 330 / 664 » Subshifts, Languages and Logic |
158
click to vote
ICFP
2005
ACM
16 years 6 months ago
2005
ACM
Writing loops with tail-recursive function calls is the equivalent of writing them with goto's. Given that loop packages for Lisp-family languages have been around for over 2...
179
click to vote
ICFP
2002
ACM
16 years 6 months ago
2002
ACM
We propose an extension of Haskell's type class system with bstractions in the type language. Type inference for our extension relies on a novel constrained unification proce...
166
click to vote
FOAL
2007
ACM
15 years 10 months ago
2007
ACM
The relation between aspects and monads is a recurring topic in discussions in the programming language community, although it has never been elaborated whether their resemblences...
159
click to vote
CAV
1999
Springer
15 years 11 months ago
1999
Springer
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...
183
click to vote
CSL
2006
Springer
15 years 10 months ago
2006
Springer
The goal of this note is to provide a background and references for the invited lecture presented at Computer Science Logic 2006. We briefly discuss motivations that led to the eme...