Sciweavers

483 search results - page 32 / 97
» Intuitionistic hybrid logic
Sort
View
ESOP
2001
Springer
14 years 3 days ago
Proof-Directed De-compilation of Low-Level Code
Abstract. We present a proof theoretical method for de-compiling lowlevel code to the typed lambda calculus. We first define a proof system for a low-level code language based on...
Shin-ya Katsumata, Atsushi Ohori
JAPLL
2010
126views more  JAPLL 2010»
13 years 2 months ago
Justification logics and hybrid logics
Hybrid logics internalize their own semantics. Members of the newer family of justification logics internalize their own proof methodology. It is an appealing goal to combine thes...
Melvin Fitting
TLCA
2005
Springer
14 years 1 months ago
A Lambda Calculus for Quantum Computation with Classical Control
The objective of this paper is to develop a functional programming language for quantum computers. We develop a lambda calculus for the classical control model, following the firs...
Peter Selinger, Benoît Valiron
LANMR
2004
13 years 9 months ago
Computing Preferred Safe Beliefs
We recently proposed a definition of a language for nonmonotonic reasoning based on intuitionistic logic. Our main idea is a generalization of the notion of answer sets for arbitr...
Luis A. Montiel, Juan A. Navarro
CORR
2006
Springer
123views Education» more  CORR 2006»
13 years 7 months ago
Continuations, proofs and tests
Continuation Passing Style (CPS) is one of the most important issues in the field of functional programming languages, and the quest for a primitive notion of types for continuati...
Stefano Guerrini, Andrea Masini