Specifying programs with propositions and with congruences

04/26/2023
by   Gilles Dowek, et al.
0

We give a presentation of Krivine and Parigot's Second-order functional arithmetic in Deduction modulo. Expressing this theory in Deduction modulo sheds light on an original aspect of this theory: the fact that programs are specified, not with propositions, but with congruences.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/25/2021

On Measure Quantifiers in First-Order Arithmetic (Long Version)

We study the logic obtained by endowing the language of first-order arit...
research
02/15/2022

The pseudofinite monadic second order theory of words

We analyse the pseudofinite monadic second order theory of words over a ...
research
01/29/2018

Equivariant ZFA and the foundations of nominal techniques

We give an accessible presentation to the foundations of nominal techniq...
research
03/19/2019

On the weight distribution of second order Reed-Muller codes and their relatives

The weight distribution of second order q-ary Reed-Muller codes have bee...
research
04/11/2023

Tracing OCaml Programs

This presentation will cover a framework for application-level tracing o...
research
04/02/2018

An interpretation of system F through bar recursion

There are two possible computational interpretations of second-order ari...
research
12/03/2019

On the Herbrand Functional Interpretation

We show that the types of the witnesses in the Herbrand functional inter...

Please sign up or login with your details

Forgot password? Click here to reset