Simply typed lambda calculus

Results: 80



#Item
1Type theory / Theoretical computer science / Mathematical logic / Programming language theory / Lambda calculus / Formal methods / Logic in computer science / CurryHoward correspondence / HindleyMilner type system / Simply typed lambda calculus / Type system / Proof assistant

PML : A new proof assistant and deduction system Christophe Raffalli LAMA

Add to Reading List

Source URL: www.lama.univ-savoie.fr

Language: English - Date: 2007-07-02 08:10:34
2Software engineering / Type theory / Computing / Programming language theory / Type system / CurryHoward correspondence / Typed lambda calculus / Simply typed lambda calculus / Type rule / Type safety / Typing environment / Go

Fuzzing the Rust Typechecker Using CLP Kyle Dewey Jared Roesch Ben Hardekopf

Add to Reading List

Source URL: jroesch.github.io

Language: English - Date: 2016-04-16 20:16:50
3Theoretical computer science / Mathematical logic / Computer science / Logic in computer science / Lambda calculus / Models of computation / Proof theory / Computability theory / Simply typed lambda calculus / Natural deduction / CurryHoward correspondence

An Introduction to Logical Relations Proving Program Properties Using Logical Relations Lau Skorstengaard Contents

Add to Reading List

Source URL: www.cs.uoregon.edu

Language: English - Date: 2016-06-30 02:06:10
4Mathematical logic / Logic / Type theory / Theoretical computer science / Lambda calculus / Dependently typed programming / Proof theory / Logic in computer science / CurryHoward correspondence / Dependent type / System F / Simply typed lambda calculus

Final test: Type Theory and Coqjanuary 2011, 10:30–12:30, HG00.308 The mark for this test is the total number of points divided by ten, where the first 10 points are free. 1. Give a term of the simply typed la

Add to Reading List

Source URL: www.cs.ru.nl

Language: English - Date: 2011-01-18 05:58:42
5Computability theory / Lambda calculus / Theoretical computer science / Computer science / Mathematics / Academia / Proof theory

Chapter 3 Simple Types We study simple types in this chapter, We first formalize a simply-typed programming language L0 and then establish its type soundness, setting some machinery for development in the following chap

Add to Reading List

Source URL: www.cs.bu.edu

Language: English - Date: 2009-12-18 13:56:03
6Type theory / Mathematical logic / Theoretical computer science / Lambda calculus / Mathematics / CurryHoward correspondence / Dependent type / Church encoding / System F / Simply typed lambda calculus / Natural deduction / Combinatory logic

Type theory and proof assistants 21 January 2009, 15.30–17.30 This test has 15 exercises, and each exercise is worth 6 points. The first 10 points are free, and the final mark is the number of points divided by ten. Go

Add to Reading List

Source URL: www.cs.ru.nl

Language: English - Date: 2011-01-12 07:22:28
7Type theory / Logic in computer science / Models of computation / Computability theory / Metalogic / Model theory / Simply typed lambda calculus / Lambda calculus / CurryHoward correspondence / Intuitionistic type theory

Uniqueness Typing Simplified—Technical Appendix Edsko de Vries∗ Department of Computer Science Trinity College Dublin, Ireland August 13, 2008

Add to Reading List

Source URL: www.edsko.net

Language: English - Date: 2016-08-02 06:27:04
8Lambda calculus / Anonymous function / Currying / Simply typed lambda calculus / Type theory / Function / Combinatory logic / Partial application

simply typed λ-calculus logical verification week

Add to Reading List

Source URL: www.cs.ru.nl

Language: English - Date: 2004-12-15 12:39:12
9

The Next 700 Modal Type Assignment Systems Andreas Abel Department of Computer Science and Engineering Gothenburg University We exhibit a generic modal type system for simply-typed lambda-calculus that subsumes

Add to Reading List

Source URL: www2.tcs.ifi.lmu.de

Language: English - Date: 2015-12-07 10:26:09
    10Type theory / Lambda calculus / Type systems / Models of computation / Program analysis / Simply typed lambda calculus / Gradual typing / Monad / System F

    The Gradualizer: A Methodology and Algorithm for Generating Gradual Type Systems Matteo Cimini Jeremy G. Siek

    Add to Reading List

    Source URL: dl.dropboxusercontent.com

    Language: English
    UPDATE