Computation first: rebuilding constructivism with effects (invited talk)
From MaRDI portal
Cites work
- \(\text{TT}^\Box_{\mathcal{C}}\): a family of extensional type theories with effectful realizers of continuity
- ``Upon this quote I will build my Church thesis
- A computational interpretation of forcing in type theory
- A new extraction for Coq
- A note on forcing and type theory
- A remark on free choice sequences and the topological completeness proofs
- A sequent calculus with dependent types for classical arithmetic
- An effectful way to eliminate addiction to dependence
- Axiom of Choice and Complementation
- Axiomatic reals and certified efficient exact real computation
- Characterizing partitioned assemblies and realizability toposes
- Classical call-by-need sequent calculi: the unity of semantic artifacts
- Constructing unprejudiced extensional type theories with choices via modalities
- Continuity of Gödel's system T definable functionals via effectful forcing
- Dependent choice, `quote' and the clock
- Evidenced frames. A unifying framework broadening realizability models
- Existential witness extraction in classical realizability and via a negative translation
- Failure is not an option. An exceptional type theory
- Forcing in Proof Theory
- From partial to monadic: combinatory algebra with effects
- Gardening with the pythia a model of continuity in a dependent setting
- scientific article; zbMATH DE number 5851813 (Why is no real title available?)
- scientific article; zbMATH DE number 3839951 (Why is no real title available?)
- scientific article; zbMATH DE number 3859117 (Why is no real title available?)
- scientific article; zbMATH DE number 5360217 (Why is no real title available?)
- scientific article; zbMATH DE number 3556031 (Why is no real title available?)
- scientific article; zbMATH DE number 7178362 (Why is no real title available?)
- scientific article; zbMATH DE number 2204804 (Why is no real title available?)
- scientific article; zbMATH DE number 3216998 (Why is no real title available?)
- scientific article; zbMATH DE number 5064954 (Why is no real title available?)
- Inductive continuity via Brouwer trees
- Metamathematical investigation of intuitionistic arithmetic and analysis. With contributions by C. A. Smorynski, J. I. Zucker and W. A. Howard
- Non-angelic concurrent game semantics
- Notions of computation and monads
- On bar recursion and choice in a classical setting
- On the Cauchy completeness of the constructive Cauchy reals
- On the computational content of the axiom of choice
- On the interpretation of intuitionistic number theory
- Open bar -- a Brouwerian intuitionistic logic with a pinch of excluded middle
- Realizability and parametricity in pure type systems
- Realizability with stateful computations for nonstandard analysis
- Realizability. An introduction to its categorical side
- Realizing continuity using stateful computations
- Russian constructivism in a prefascist theory
- Separating Markov's principles
- The definitional side of the forcing
- The duality of computation
- The effects of effects on constructivism
- The independence of Markov's principle in type theory
- The modified realizability topos
- Tripos theory
- Tripos theory in retrospect
- ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES
This page was built for publication: Computation first: rebuilding constructivism with effects (invited talk)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7296791)