Results 271 to 280 of about 9,301 (306)

Reducibility Proofs in the λ-Calculus

Fundamenta Informaticae, 2012
Reducibility, despite being quite mysterious and inflexible, has been used to prove a number of properties of the λ-calculus and is well known to offer general proofs which can be applied to a number of instantiations. In this paper, we look at two related but different results in λ-calculi with intersection types. 1.
Kamareddine, Fairouz, Rahli, Vincent, Wells, J. B.   +2 more
openaire   +1 more source

Calculus of classical proofs I

1997
We introduce a simple natural deduction system of classical propositional logic called λ exc v , and prove the computational properties of the system based on a call-by-value strategy. We show (1) a strict fragment of gl exc v that is complete with respect to classical provability, and the computational meaning of the existence of such a fragment; (2 ...
openaire   +1 more source

FIRST-YEAR STUDENTS LOVE CALCULUS PROOFS

PRIMUS, 1997
ABSTRACT Student comprehension of calculus can be improved by lecturing less and having students do guided investigations of proofs or derivations. The author presents a method to help students learn the architecture of proofs and suggests a writing assignment for assessment.
openaire   +1 more source

Proof Nets for the π-Calculus

In this paper, we establish the foundations of a novel logical framework for the π-calculus, based on the deduction-as-computation paradigm. Following the standard proof-theoretic interpretation of logic programming, we represent processes as formulas, and we interpret proofs as computations. For this purpose, we define a cut-free sequent calculus for
Acclavio, Matteo, Manara, Giulia
openaire   +1 more source

Second-Order Calculus of Proof Functions

1998
The Second-Order Calculus of Proof Functions (2CPF) is obtained from the Calculus of Proof Functions (CPF) in Chapter 28 as follows.
openaire   +1 more source

Lambek Calculus Proofs and Tree Automata

2001
We investigate natural deduction proofs of the Lambek calculus from the point of view of tree automata. The main result is that the set of proofs of the Lambek calculus cannot be accepted by a finite tree automaton. The proof is extended to cover the proofs used by grammars based on the Lambek calculus, which typically use only a subset of the set of ...
openaire   +1 more source

A Calculus for Game-Based Security Proofs

2010
The game-based approach to security proofs in cryptography is a widely-used methodology for writing proofs rigorously. However a unifying language for writing games is still missing. In this paper we show how CSLR, a probabilistic lambda-calculus with a type system that guarantees that computations are probabilistic polynomial time, can be equipped ...
David Nowak, Yu Zhang
openaire   +1 more source

THE CHEAT-PROOF CALCULUS TEST

EDULEARN Proceedings, 2023
openaire   +1 more source

Structured Specifications: Syntax, Semantics and Proof Calculus

1993
In this paper, a small but expressive language is presented that allows to write algebraic specifications in a structured and modular way. Proof rules are developed for each construct of the language; in particular, proof systems are given for flat specifications, for structured specifications and the verification of implementations.
openaire   +1 more source

Calculus Proofs

2020
openaire   +1 more source