Database Queries that Explain their Work James Cheney Amal Ahmed Umut A. Acar

Source URL: www.ccs.neu.edu

• Software engineering
• Computer programming
• Programming language theory
• Linear algebra
• Software design patterns
• Matrix theory
• Trace
• Program slicing
• Monad
• Substitution
• FO
• ALGOL 68

Scala for TAPL’ers Part 3 Ilya Sergey 16 November 2010

Source URL: ilyasergey.net

• Software engineering
• Computer programming
• Computing
• Functional programming
• Software design patterns
• Monad
• Scripting languages
• Type theory
• Foreach loop
• Null
• Scala
• Option type

Introduction & overview The expectation monad, effect algebras/modules & other monads Algebras of the expectation monad & duality Relevance for quantum foundations & probabilistic programming Conclusions

Source URL: www.cs.ru.nl

Foundations for Computable Topology Paul Taylor 8 April 2009 Abstract Foundations should be designed for the needs of mathematics and not vice versa. We propose a technique for doing this that exploits the correspondence

Source URL: www.monad.me.uk

FliPpr: A Prettier Invertible Printing System Kazutaka Matsuda1 and Meng Wang2 1 2

Source URL: www2.sf.ecei.tohoku.ac.jp

• Software engineering
• Computer programming
• Parsing algorithms
• Software
• Functional programming
• Parsing
• Logic in computer science
• Compiler construction
• Top-down parsing
• Monad
• Compiler-compiler
• Combinatory logic

Noninterference for Free ⇤ William J. Bowman Amal Ahmed Northeastern University, USA

Source URL: www.ccs.neu.edu

• Models of computation
• Type theory
• Formal methods
• Theory of computation
• Equivalence relation
• Monad
• Denotational semantics
• Parametricity
• Simply typed lambda calculus
• Modal logic
• Lambda calculus

A Theory of Indirection via Approximation Aquinas Hobor ∗† Robert Dockins† Andrew W. Appel †

Source URL: www.cs.princeton.edu

• Mathematical logic
• Software engineering
• Logic
• Formal languages
• Computability theory
• Models of computation
• Lambda calculus
• Formal methods
• Interpretation
• Syntactic predicate
• System F
• Monad

Galois Transformers and Modular Abstract Interpreters Reusable Metatheory for Program Analysis David Darais Matthew Might

Source URL: matt.might.net

• Computer programming
• Mathematics
• Software engineering
• Functional programming
• Monad
• operator
• Structure
• Closure

Scott Domains in Abstract Stone Duality Paul Taylor August 5, 2003 Abstract Identifying the need for Scott domains to be overt (open) objects in intuitionistic locale theory, we re-work Scott’s informations systems con

Source URL: www.monad.me.uk

Logical Methods in Computer Science Volume 00, Number 0, Pages 000–000 SXX λ -RBAC: PROGRAMMING WITH ROLE-BASED ACCESS CONTROL RADHA JAGADEESAN, ALAN JEFFREY, CORIN PITCHER, AND JAMES RIELY

Source URL: ect.bell-labs.com

• Type theory
• Algebraic geometry
• Computability theory
• Lambda calculus
• Theoretical computer science
• Role-based access control
• Valuation
• Subtyping
• Monad
• CurryHoward correspondence