Sciweavers

400 search results - page 29 / 80
» Logical relations for monadic types
Sort
View
ICFP
2010
ACM
13 years 8 months ago
The impact of higher-order state and control effects on local relational reasoning
Reasoning about program equivalence is one of the oldest problems in semantics. In recent years, useful techniques have been developed, based on bisimulations and logical relation...
Derek Dreyer, Georg Neis, Lars Birkedal
VLDB
2007
ACM
118views Database» more  VLDB 2007»
14 years 8 months ago
Eliminating Impedance Mismatch in C++
Recently, the C# and the VISUAL BASIC communities were tantalized by the advent of LINQ [18]--the Language INtegrated Query technology from Microsoft. LINQ represents a set of lan...
Joseph Gil, Keren Lenz
POPL
2003
ACM
14 years 8 months ago
Pure patterns type systems
We introduce a new framework of algebraic pure type systems in which we consider rewrite rules as lambda terms with patterns and rewrite rule application as abstraction applicatio...
Gilles Barthe, Horatiu Cirstea, Claude Kirchner, L...
IANDC
2006
117views more  IANDC 2006»
13 years 7 months ago
A modular approach to defining and characterising notions of simulation
We propose a modular approach to defining notions of simulation, and modal logics which characterise them. We use coalgebras to model state-based systems, relators to define notio...
Corina Cîrstea
CSL
2010
Springer
13 years 8 months ago
Ordered Sets in the Calculus of Data Structures
Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints...
Viktor Kuncak, Ruzica Piskac, Philippe Suter