Sciweavers

2944 search results - page 151 / 589
» On Well Quasi-orders on Languages
Sort
View
102
Voted
ENTCS
2002
84views more  ENTCS 2002»
15 years 18 days ago
Programming Autonomous Robots in Curry
In this paper we present a framework to program autonomous robots in the declarative multi-paradigm language Curry. This is an experiment to use high-level declarative programming...
Michael Hanus, Klaus Höppner
200
Voted
PLDI
2009
ACM
16 years 1 months ago
Chameleon: adaptive selection of collections
Languages such as Java and C#, as well as scripting languages like Python, and Ruby, make extensive use of Collection classes. A collection implementation represents a fixed choic...
Ohad Shacham, Martin T. Vechev, Eran Yahav
PODS
2009
ACM
122views Database» more  PODS 2009»
16 years 1 months ago
Satisfiability of downward XPath with data equality tests
In this work we investigate the satisfiability problem for the logic XPath( , , =), that includes all downward axes as well as equality and inequality tests. We address this probl...
Diego Figueira
209
Voted
POPL
2006
ACM
16 years 1 months ago
Formal certification of a compiler back-end or: programming a compiler with a proof assistant
This paper reports on the development and formal certification (proof of semantic preservation) of a compiler from Cminor (a Clike imperative language) to PowerPC assembly code, u...
Xavier Leroy
187
Voted
POPL
2005
ACM
16 years 1 months ago
Associated types with class
Haskell's type classes allow ad-hoc overloading, or typeindexing, of functions. A natural generalisation is to allow type-indexing of data types as well. It turns out that th...
Manuel M. T. Chakravarty, Gabriele Keller, Simon L...