Sciweavers

8766 search results - page 144 / 1754
» Functional logic programming
Sort
View
SAS
2009
Springer
171views Formal Methods» more  SAS 2009»
15 years 10 months ago
Bottom-Up Shape Analysis
In this paper we present a new shape analysis algorithm. The key distinguishing aspect of our algorithm is that it is completely compositional, bottom-up and non-iterative. We pres...
Bhargav S. Gulavani, Supratik Chakraborty, Ganesan...
POPL
2010
ACM
15 years 7 months ago
Nominal System T
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
Andrew M. Pitts
TACAS
1998
Springer
131views Algorithms» more  TACAS 1998»
15 years 2 months ago
Detecting Races in Relay Ladder Logic Programs
Relay Ladder Logic (RLL) [4] is a programming language widely used for complex embedded control applications such as manufacturing and amusement park rides. The cost of bugs in RLL...
Alexander Aiken, Manuel Fähndrich, Zhendong S...
FPCA
1989
15 years 2 months ago
Theorems for Free!
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., v...
Philip Wadler
CADE
2001
Springer
15 years 10 months ago
A Sequent Calculus for First-Order Dynamic Logic with Trace Modalities
The modalities of Dynamic Logic refer to the final state of a program execution and allow to specify programs with pre- and postconditions. In this paper, we extend Dynamic Logic w...
Bernhard Beckert, Steffen Schlager