Back to Results
First PageMeta Content
Proof theory / Lambda calculus / Type theory / Logic in computer science / Model theory / Natural deduction / System F / Function / Sequent calculus / Mathematical logic / Logic / Mathematics


Which simple types have a unique inhabitant? Gabriel Scherer Didier R´emy INRIA
Add to Reading List

Document Date: 2015-03-03 05:16:01


Open Document

File Size: 386,94 KB

Share Result on Facebook

/

Facility

We store / /

IndustryTerm

recursive search branch / search finds / restricted search space / search function / expressive type systems / Backward search / generic search discipline / search process / search process forbidding / given search path / then search / canonical systems / unicity-complete algorithm / search space restrictions / non-focused proof search / finite search space / proof search problem / proof search literature / search/elaboration procedure / forward search / less redundant proof search / search procedure / realistic type systems / backward-search perspective / search strategy / proof search process / infinite search space / type systems / post-processing filter / proof search discipline / connection-based search / naive proof search / term search / search space break computational completeness / search space / search algorithm / proof search / positive and negative products / invertible search takes / unicity-deciding algorithm / /

OperatingSystem

Sequent / /

Organization

eta / /

Person

Wallen / Nat / Ai / Sam Lindley / Gabriel Scherer Didier / /

Position

forward / programmer / /

ProgrammingLanguage

Haskell / R / C / ML / K / /

RadioStation

5.4 The Arrow / /

Technology

functional programming / corresponding search algorithm / search algorithm / 3/3 3.2 Search algorithm / unicity-deciding algorithm / terminating search algorithm / terminating algorithm / /

SocialTag