Sciweavers

234 search results - page 26 / 47
» Ruler: Programming Type Rules
Sort
View
TLDI
2009
ACM
111views Formal Methods» more  TLDI 2009»
14 years 4 months ago
A generic type-and-effect system
Type-and-effect systems are a natural approach for statically reasoning about a program’s execution. They have been used to track a variety of computational effects, for example...
Daniel Marino, Todd D. Millstein
BIRTHDAY
2009
Springer
14 years 2 months ago
An Action Semantics Based on Two Combinators
We propose a naive version of action semantics that begins with a selection of “transient” and “persistent” facets, each characterized as a partial monoid. Yielders are de...
Kyung-Goo Doh, David A. Schmidt
CADE
2010
Springer
13 years 8 months ago
Beluga: A Framework for Programming and Reasoning with Deductive Systems (System Description)
Beluga is an environment for programming and reasoning about formal systems given by axioms and inference rules. It implements the logical framework LF for specifying and prototypi...
Brigitte Pientka, Joshua Dunfield
POPL
2008
ACM
14 years 8 months ago
Cyclic proofs of program termination in separation logic
We propose a novel approach to proving the termination of heapmanipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system. Judgement...
James Brotherston, Richard Bornat, Cristiano Calca...
ENTCS
2007
85views more  ENTCS 2007»
13 years 7 months ago
Inducing Constructor Systems from Example-Terms by Detecting Syntactical Regularities
We present a technique for inducing functional programs from few, well chosen input/output-examples (I/Oexamples). Potential applications for automatic program or algorithm induct...
Emanuel Kitzelmann, Ute Schmid