Sciweavers

558 search results - page 28 / 112
» Compiling Resources in a Linear Logic Programming Language
Sort
View
GECCO
2005
Springer
133views Optimization» more  GECCO 2005»
14 years 4 months ago
Parsing and translation of expressions by genetic programming
We have investigated the potential for using genetic programming to evolve compiler parsing and translation routines for processing arithmetic and logical expressions as they are ...
David Jackson
APLAS
2008
ACM
14 years 24 days ago
Reasoning about Java's Reentrant Locks
This paper presents a verification technique for a concurrent Java-like language with reentrant locks. The verification technique is based on permissionaccounting separation logic....
Christian Haack, Marieke Huisman, Clément H...
PPDP
2010
Springer
13 years 9 months ago
Type inference in intuitionistic linear logic
We study the type checking and type inference problems for intuitionistic linear logic: given a System F typed λ-term, (i) for an alleged linear logic type, determine whether the...
Patrick Baillot, Martin Hofmann
PLDI
2003
ACM
14 years 4 months ago
Automatically proving the correctness of compiler optimizations
We describe a technique for automatically proving compiler optimizations sound, meaning that their transformations are always semantics-preserving. We first present a domainspeci...
Sorin Lerner, Todd D. Millstein, Craig Chambers
CEFP
2005
Springer
14 years 4 months ago
Exploiting Purely Functional Programming to Obtain Bounded Resource Behaviour: The Hume Approach
This chapter describes Hume: a functionally-based language for programming with bounded resource usage, including time and space properties. The purpose of the Hume language design...
Kevin Hammond