Hoogλe Finding Functions from Types Neil Mitchell haskell.org/hoogle community.haskell.org/~ndm/

Source URL: ndmitchell.com

• Software engineering
• Computing
• Computer programming
• Data types
• Functional languages
• Primitive types
• Functional programming
• Edit distance
• String
• Haskell
• Id
• Boolean data type

2012 ACM@UVa HSPC C++ Cheatsheet If Statement Primitive Data Types if ( Boolean Expression ){

Source URL: acm.cs.virginia.edu

On the Computational Content of the Bolzano-Weierstraß Principle∗ Pavol Safarik and Ulrich Kohlenbach Department of Mathematics Technische Universität Darmstadt Schlossgartenstraße 7, 64289 Darmstadt, Germany

Source URL: www.mathematik.tu-darmstadt.de

• Proof theory
• Logic
• Mathematical logic
• Mathematics
• Computability theory
• Primitive recursive functional
• Dialectica interpretation
• Combinatory logic
• Continuous function

! Revised Wednesday, December 9, 2015! 1

Source URL: kiwi.atmos.colostate.edu

• Partial differential equations
• Computational fluid dynamics
• Finite element method
• Climate modeling
• Atmospheric dispersion modeling
• MEMO Model
• Arakawa grids
• Smoothed-particle hydrodynamics
• Geodesic grid
• Primitive equations
• Numerical methods in fluid mechanics
• Atmospheric model

Herbrand’s theorem and extractive proof theory U. Kohlenbach Department of Mathematics Technische Universit¨at Darmstadt Schlossgartenstrasse 7, 64289 Darmstadt, Germany September 1, 2008

Source URL: www.mathematik.tu-darmstadt.de

• Mathematics
• Mathematical analysis
• Mathematical logic
• Functions and mappings
• Computability theory
• Primitive recursive function
• Recursion
• Theory of computation
• First-order logic
• Limit of a function
• Peano axioms
• Spectral theory of ordinary differential equations

FOUNDATIONAL AND MATHEMATICAL USES OF HIGHER TYPES ULRICH KOHLENBACH† DEDICATED TO SOLOMON FEFERMAN FOR HIS 70TH BIRTHDAY §1. Introduction. A central theme of proof theory is expressed by the following question:

Source URL: www.mathematik.tu-darmstadt.de

• Computability theory
• Proof theory
• Mathematical logic
• Metalogic
• Reverse mathematics
• Primitive recursive functional
• Second-order arithmetic
• Peano axioms
• Primitive recursive function
• Primitive recursive arithmetic
• Model theory
• Symbol

On weak Markov’s principle Ulrich Kohlenbach BRICS∗ Department of Computer Science University of Aarhus Ny Munkegade

Source URL: www.mathematik.tu-darmstadt.de

• Constructivism
• Mathematics
• Computability theory
• Mathematical logic
• Mathematical proofs
• Functions and mappings
• Abstraction
• Proof theory
• Realizability
• Constructive proof
• Primitive recursive function
• operator

Mathematically strong subsystems of analysis with low rate of growth of provably recursive functionals Ulrich Kohlenbach Fachbereich Mathematik J.W. Goethe–Universit¨at D–60054 Frankfurt, Germany

Source URL: www.mathematik.tu-darmstadt.de

• Computability theory
• Mathematics
• Mathematical logic
• Mathematical analysis
• Primitive recursive functional
• Symbol
• Continuous function
• Primitive recursive function
• operator
• Spectral theory of ordinary differential equations

A note on the monotone functional interpretation Ulrich Kohlenbach∗ Department of Mathematics Technische Universit¨at Darmstadt Schlossgartenstraße 7, 64289 Darmstadt, Germany April 18, 2011

Source URL: www.mathematik.tu-darmstadt.de

• Proof theory
• Computability theory
• Dialectica interpretation
• Intuitionism
• Symbol
• operator
• Primitive recursive functional

Pointwise hereditary majorization and some applications Ulrich Kohlenbach Fachbereich Mathematik, J.W.Goethe–Universit¨at Robert–Mayer–Str. 6–10, 6000 Frankfurt am Main, FRG Abstract A pointwise version of the H

Source URL: www.mathematik.tu-darmstadt.de

• Computability theory
• Primitive recursive functional
• Proof theory
• Continuous function
• Spectral theory of ordinary differential equations
• It diffusion