Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Logical Step-Indexed Logical Relations Derek Dreyer
 

Summary: Logical Step-Indexed Logical Relations
Derek Dreyer
MPI-SWS
dreyer@mpi-sws.org
Amal Ahmed
TTI-Chicago
amal@tti-c.org
Lars Birkedal
IT University of Copenhagen
birkedal@itu.dk
Abstract
We show how to reason about "step-indexed" logi-
cal relations in an abstract way, avoiding the tedious,
error-prone, and proof-obscuring step-index arithmetic that
seems superficially to be an essential element of the method.
Specifically, we define a logic LSLR, which is inspired by
Plotkin and Abadi's logic for parametricity, but also sup-
ports recursively defined relations by means of the modal
"later" operator from Appel et al.'s "very modal model"
paper. We encode in LSLR a logical relation for reasoning

  

Source: Ahmed, Amal - School of Informatics, Indiana University
Birkedal, Lars - Theory Department, IT-Universitetet i KÝbenhavn

 

Collections: Computer Technologies and Information Sciences