Sciweavers

1143 search results - page 91 / 229
» Abstract Syntax and Logic Programming
Sort
View
CIE
2010
Springer
15 years 7 months ago
Higher-Order Containers
Containers are a semantic way to talk about strictly positive types. In previous work it was shown that containers are closed under various constructions including products, coprod...
Thorsten Altenkirch, Paul Levy, Sam Staton
COLING
1992
15 years 3 months ago
Towards Robust PATR
We report on the initial stages of development of a robust parsing system, to be used as part of The Editor's Assistant, a program that detects and corrects textual errors an...
Shona Douglas, Robert Dale
JCSS
2010
102views more  JCSS 2010»
15 years 28 days ago
Matching and alpha-equivalence check for nominal terms
Nominal techniques were introduced to represent in a simple and natural way that involve binders. The syntax includes an abstraction operator and a primitive notion of name swappin...
Christophe Calvès, Maribel Fernández
CAV
2006
Springer
143views Hardware» more  CAV 2006»
15 years 6 months ago
Automatic Termination Proofs for Programs with Shape-Shifting Heaps
We describe a new program termination analysis designed to handle imperative programs whose termination depends on the mutation rogram's heap. We first describe how an abstrac...
Josh Berdine, Byron Cook, Dino Distefano, Peter W....
SIGCSE
1992
ACM
178views Education» more  SIGCSE 1992»
15 years 6 months ago
A graphical computer simulator for systems programming courses
on through abstract instructions which approximate, but do not duplicate, the behavior of actual machines. Because they are designed for use in a variety of educational settings, C...
Mark Newsome, Cherri M. Pancake