CARTOGRAPHIC GENERALIZATION IN A DIGITAL ENVIRONMENT: WHEN AND How To GENERALIZE K. Stuart Shea The Analytic Sciences Corporation (TASCSunset Hills Road Reston, Virginia 22090

Source URL: mapcontext.com

• Cartography
• Geographic information systems
• Cartographic generalization
• Communication design
• Graphic design
• Inductive reasoning
• Generalization
• Visual arts
• Software engineering
• Topological map
• HindleyMilner type system
• Topography

newsflash Simon ! mice ! -1

Source URL: www.cs.ru.nl

• Type theory
• Mathematical logic
• Inductive type
• Structure
• Logic
• Inductive reasoning

logical verificationexercises 2 Exercise 1. This exercise is concerned with dependent types. We use the following definition in Coq: Inductive natlist_dep : nat -> Set := | nil_dep : natlist_dep 0

Source URL: www.cs.ru.nl

• Logic
• Mathematical logic
• Mathematics
• Type theory
• Propositional calculus
• Syntax
• Predicate logic
• CurryHoward correspondence
• Dependent type
• Lambda calculus
• First-order logic
• Proposition

sadhana manuscript No. (will be inserted by the editor) A compact kernel for the calculus of inductive constructions A. Asperti · W. Ricciotti ·

Source URL: matita.cs.unibo.it

• Type theory
• Matita
• Calculus of constructions
• Lambda calculus
• Recursion
• Positive-definite kernel
• Anonymous function
• Metavariable
• HindleyMilner type system
• Type inference
• Parameter
• Dependent type

A BI-DIRECTIONAL REFINEMENT ALGORITHM FOR THE CALCULUS OF (CO)INDUCTIVE CONSTRUCTIONS ANDREA ASPERTI, WILMER RICCIOTTI, CLAUDIO SACERDOTI COEN, AND ENRICO TASSI Dipartimento di Scienze dell’informazione, Mura Anteo Zam

Source URL: matita.cs.unibo.it

• Type theory
• Matita
• Agda
• Unification
• Calculus of constructions
• Type system
• HindleyMilner type system
• System F
• Refinement
• Type inference
• Algorithm
• Dependent type

Types in functional languages Dependent types and the Propositions-as-Types Isomorphism The Coq system and inductive types Rich types for programming and proving Radboud University Nijmegen

Source URL: www.cs.ru.nl

• Type theory
• Functional languages
• Proof assistants
• Dependently typed programming
• Logic in computer science
• Coq
• Dependent type
• Functional programming
• Haskell
• Inductive type
• Quicksort
• CurryHoward correspondence

The Church-Scott representation of inductive and coinductive data in (typed) λ calculus Herman Geuvers Radboud University Nijmegen and Eindhoven University of Technology

Source URL: www.cs.ru.nl

• Computability theory
• Lambda calculus
• Recursion
• Theoretical computer science
• Type theory
• Combinatory logic
• Church encoding
• Initial algebra
• Primitive recursive function

Nuprl's Inductive Logical Forms

Source URL: www.ai4fm.org

• Type theory
• Mathematical logic
• Logic
• Hierarchy
• Structure
• Reasoning
• Automated theorem proving
• Epistemology
• Inductive reasoning
• Nuprl
• Logic programming

Inductive and Coinductive Data Types in Typed Lambda Calculus Revisited Herman Geuvers Radboud University Nijmegen and Eindhoven University of Technology

Source URL: www.cs.ru.nl

• Type theory
• Computability theory
• Functional programming
• Theoretical computer science
• Recursion
• Initial algebra
• Lambda calculus
• Primitive recursive function
• Inductive type
• Catamorphism
• F-algebra

Type-Based Termination, Inflationary Fixed-Points, and Mixed Inductive-Coinductive Types Andreas Abel Department of Computer Science Ludwig-Maximilians-University Munich, Germany

Source URL: www.cse.chalmers.se