DeepAI AI Chat
Log In Sign Up

Stateful Realizers for Nonstandard Analysis

by   Bruno Dinis, et al.

In this paper we propose a new approach to realizability interpretations for nonstandard arithmetic. We deal with nonstandard analysis in the context of (semi)intuitionistic realizability, focusing on the Lightstone-Robinson construction of a model for nonstandard analysis through an ultrapower. In particular, we consider an extension of the λ-calculus with a memory cell, that contains an integer (the state), in order to indicate in which slice of the ultrapower M^ℕ the computation is being done. We pay attention to the nonstandard principles (and their computational content) obtainable in this setting. In particular, we give non-trivial realizers to Idealization and a non-standard version of the LLPO principle. We then discuss how to quotient this product to mimic the Lightstone-Robinson construction.


page 1

page 2

page 3

page 4


Towards the average-case analysis of substitution resolution in λ-calculus

Substitution resolution supports the computational character of β-reduct...

Stochastic Network Calculus with Localized Application of Martingales

Stochastic Network Calculus is a probabilistic method to compute perform...

An Incremental Slicing Method for Functional Programs

Several applications of slicing require a program to be sliced with resp...

Computing Nearby Non-trivial Smith Forms

We consider the problem of computing the nearest matrix polynomial with ...

From Semantics to Types: the Case of the Imperative lambda-Calculus

We propose an intersection type system for an imperative lambda-calculus...

Construction and Extension of Dispersion Models

There are two main classes of dispersion models studied in the literatur...