Sciweavers

237 search results - page 34 / 48
» Coercions in a polymorphic type system
Sort
View
FLOPS
2010
Springer
14 years 2 months ago
Automatically Generating Counterexamples to Naive Free Theorems
Disproof can be as important as proof in studying programs and programming languages. In particular, side conditions in a statement about program behavior are sometimes best unders...
Daniel Seidel, Janis Voigtländer
CAV
2011
Springer
207views Hardware» more  CAV 2011»
12 years 11 months ago
Interactive Synthesis of Code Snippets
Abstract. We describe a tool that applies theorem proving technology to synthesize code fragments that use given library functions. To determine candidate code fragments, our appro...
Tihomir Gvero, Viktor Kuncak, Ruzica Piskac
ENTCS
2007
100views more  ENTCS 2007»
13 years 7 months ago
Lightweight Static Capabilities
We describe a modular programming style that harnesses modern type systems to verify safety conditions in practical systems. This style has three ingredients: (i) A compact kernel...
Oleg Kiselyov, Chung-chieh Shan
SAS
1993
Springer
139views Formal Methods» more  SAS 1993»
13 years 11 months ago
Compiling FX on the CM-2
Type and effect systems provide a safe and effective means of programming high-performance parallel computers with a high-level language that integrates both functional and impe...
Jean-Pierre Talpin, Pierre Jouvelot
ENTCS
2000
59views more  ENTCS 2000»
13 years 7 months ago
Building continuous webbed models for system F
We present here a large family of concrete models for Girard and Reynolds polymorphism (System F), in a non categorical setting. The family generalizes the construction of the mod...
Stefano Berardi, Chantal Berline