Sciweavers

393 search results - page 2 / 79
» Program and proof optimizations with type systems
Sort
View
BIRTHDAY
2010
Springer
13 years 5 months ago
Programming Inductive Proofs - A New Approach Based on Contextual Types
In this paper, we present an overview to programming with proofs in the reasoning framework, Beluga. Beluga supports the specification of formal systems given by axioms and inferen...
Brigitte Pientka
JFLP
2002
84views more  JFLP 2002»
13 years 5 months ago
Subject Reduction of Logic Programs as Proof-Theoretic Property
We consider prescriptive type systems for logic programs (as in G
Pierre Deransart, Jan-Georg Smaus
VMCAI
2012
Springer
12 years 26 days ago
Teaching Semantics with a Proof Assistant: No More LSD Trip Proofs
We describe a course on the semantics of a simple imperative programming language and on applications to compilers, type systems, static analyses and Hoare logic. The course is ent...
Tobias Nipkow
ICFP
2008
ACM
14 years 5 months ago
A type-preserving compiler in Haskell
There has been a lot of interest of late for programming languages that incorporate features from dependent type systems and proof assistants in order to capture in the types impo...
Louis-Julien Guillemette, Stefan Monnier
ICFP
2005
ACM
14 years 5 months ago
Types with semantics: soundness proof assistant
We present a parametric Hoare-like logic for computer-aided reasoning about typeable properties of functional programs. The logic is based on the concept of a specialised assertio...
Olha Shkaravska