Sciweavers

249 search results - page 28 / 50
» Principals in Programming Languages: A Syntactic Proof Techn...
Sort
View
CORR
2012
Springer
232views Education» more  CORR 2012»
12 years 4 months ago
A Formal Comparison of Approaches to Datatype-Generic Programming
-generic programming increases program abstraction and reuse by making functions operate uniformly across different types. Many approaches to generic programming have been proposed...
José Pedro Magalhães, Andres Lö...
CSFW
2008
IEEE
14 years 3 months ago
Language Based Secure Communication
Secure communication in distributed systems is notoriously hard to achieve due to the variety of attacks an adversary can mount, based on message interception, modification, redi...
Michele Bugliesi, Riccardo Focardi
ERSHOV
2009
Springer
14 years 3 months ago
Proving the Equivalence of Higher-Order Terms by Means of Supercompilation
One of the applications of supercompilation is proving properties of programs.We focus in this paper on a speci c task: proving term equivalence for a higher-order lazy functiona...
Ilya Klyuchnikov, Sergei A. Romanenko
AAAI
1996
13 years 10 months ago
Learning to Parse Database Queries Using Inductive Logic Programming
This paper presents recent work using the Chill parser acquisition system to automate the construction of a natural-language interface for database queries. Chill treats parser ac...
John M. Zelle, Raymond J. Mooney
PLDI
2009
ACM
14 years 3 months ago
Proving optimizations correct using parameterized program equivalence
Translation validation is a technique for checking that, after an optimization has run, the input and output of the optimization are equivalent. Traditionally, translation validat...
Sudipta Kundu, Zachary Tatlock, Sorin Lerner