Speaker: Jason Rute Title: Randomness, Brownian Motion, Riesz Capacity, and Complexity Abstract: Algorithmic randomness is a topic in computability theory which investigates which paths in a stochastic process behave ran

Source URL: people.clas.ufl.edu

In pursuit of decidable ‘logical form’ Michael Minock TCS/CSC KTH Royal Institute of Technology, Stockholm, Sweden Abstract

Source URL: www2.lingfil.uu.se

• Logic
• Mathematical logic
• Theoretical computer science
• Natural language processing
• Formal methods
• Computability theory
• Artificial intelligence
• Decidability
• First-order logic
• Natural language understanding
• Natural language user interface
• Entityrelationship model

Curriculum and Course Syllabi for a High-School Program in Computer Science1 Judith Gal-Ezer2 David Harel3

Source URL: www.openu.ac.il

• Computer programming
• Software engineering
• Computing
• Theoretical computer science
• Programming idioms
• Algorithms
• Computability theory
• Mathematical logic
• Recursion
• Programming paradigm
• Subroutine
• Iteration

A brief introduction to Higher Order Logic and the HOL proof assistant Monica Nesi

Source URL: www.di.univaq.it

• Mathematical logic
• Software engineering
• Theoretical computer science
• Type theory
• Computability theory
• Logic in computer science
• Proof assistants
• Logic for Computable Functions
• HOL
• Lambda calculus
• Primitive recursive function
• Recursion

Steve Warner Curriculum Vitae Department of Mathematics Hofstra University Hempstead, NY 11549

Source URL: satprepget800.com

• Mathematical logic
• Logic
• Computability theory
• Theory of computation
• Proof theory
• Hierarchy
• Lambda calculus
• Theoretical computer science
• Consistency
• Propositional calculus
• Calculus
• Arithmetical hierarchy

Characteristic Formulae for Session Types Julien Lange and Nobuko Yoshida Imperial College London Abstract. Subtyping is a crucial ingredient of session type theory and its applications, notably to programming language i

Source URL: mrg.doc.ic.ac.uk

• Software engineering
• Computability theory
• Object-oriented programming
• Polymorphism
• Subtyping
• Type theory
• Theoretical computer science
• Characteristic function
• Lambda calculus
• Computing

Powerpoint-presentation Information and Computing Sciences

Source URL: usefulpatterns.org

• Theoretical computer science
• Theory of computation
• Algorithmic information theory
• Computability theory
• Academia
• Randomness
• Turing machine
• Kolmogorov complexity
• Algorithmically random sequence
• Algorithmic probability
• Minimum description length
• Complexity

From Stack Traces to Lazy Rewriting Sequences Stephen Chang1 , Eli Barzilay1 , John Clements2 , and Matthias Felleisen1 1 2

Source URL: www.ccs.neu.edu

• Software engineering
• Computer programming
• Computing
• Functional languages
• Evaluation strategy
• Computability theory
• Lambda calculus
• Theoretical computer science
• Lazy evaluation
• Functional programming
• ALGOL 68
• Racket

PLDI: U: Type Assisted Synthesis of Recursive Transformers on Algebraic Datatypes Jeevana Priya Inala MIT Advisor: Armando Solar-Lezama

Source URL: www.acm.org

• Software engineering
• Declarative programming
• Computer programming
• Functional programming
• Theoretical computer science
• Data types
• Type theory
• Computability theory
• Lambda calculus
• Recursion
• Algebraic data type
• Anonymous function

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

Source URL: www.cs.uoregon.edu

• Theoretical 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