“Programming in Martin-Löf's Type Theory”;
1990
I oordning...
“Programming in Martin-Löf's Type Theory”;
1990
“Imperative Self-Adjusting Computation”;
2008
“Monads for Incremental Computing”;
2002
“Adaptive Functional Programming”;
2002
“On Understanding Types, Data Abstraction, and Polymorphism”;
1985
“Type Theory and Its Applications to Computer Science”;
2007
“A Theory of Type Polymorphism in Programming”;
1978
“Compiling Haskell to Java”;
1996
“First Class Patterns”;
2000
“Type Invariants for Haskell”
“Genericity versus Inheritance”;
1986
“What is Generic Programming?”;
2005
“Design Patterns for Functional Strategic Programming”;
2002
“Type Checking with Open Type Functions”;
2008
“Hybrid Type Checking”;
2006
“Arrows, Robots, and Functional Reactive Programming”;
“A type-driven approach to concrete meta programming”;
2005
“Combining Total and Ad Hoc Extensible Pattern Matching in a Lightweight Language Extension”;
MSR Technical Report MSR-TR-2007-33 (F#)
“Classical Fω, orthogonality and symmetric candidates”;
2007
“Stream Fusion - From Lists to Streams to Nothing at All”;
2007
“Why Dependent Types Matter”;
2005
“Epigram: Practical Programming with Dependent Types”;
Manualen till Epigram, ett programmeringspråk med beroende typer
“Introduction to generalized type systems”;
Catholic University Nijmegen;
Journal of Functional Programming;
1991
“Proofs and Types”;
Cambridge University Press;
1989
“Tackling the Awkward Squad: monadic input/output, concurrency, exceptions, and foreign-language calls in Haskell”;
Microsoft Research, Cambridge;
2008
“Leveraging .NET Meta-programming Components from F#”;
Microsoft Research, Cambridge;
2006
“Verifiable Functional Purity in Java”;
2008
“Typed Contracts for Functional Programming”;
2006
“A Typed Representation for HTML and XML Documents in Haskell”;
Universität Freiburg
“Interfacing Haskell with Object-Oriented Languages”;
2004
“How enterprises use functional languages, and why they don’t”;
1998
“ML Has Principal Typings”;
2005
“The Essence of ML”;
1987
“A Theory of Type Polymorphism in Programming”;
1977-1978;
Journal of Computer and System Sciences
“On the Unusual Effectiveness of Logic in Computer Science”;
2001;
(
The Bulletin of Symbolic Logic)
“Lectures on the Curry-Howard Isomorphism”;
1999
“A Comparative Study of Language Support for Generic Programming”;
Indiana University Bloomington;
2003
“Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part I”;
Massachusetts Institute of Technology;
1960
“AFAX: Rich client/server web applications in F#”;
“Monadic Parser Combinators”;
University of Nottingham;
1996
“Independently Extensible Solutions to the Expression Problem”;
“Event-Based Programming without Inversion of Control”;
“Pizza into Java: Translating theory into practice”;
1997;
Proceedings of the 24th ACM Symposium on Principles of Programming Languages (POPL'97), Paris, France
“The Girard-Reynolds Isomorphism” (second edition);
University of Edinburgh
“On Understanding Types, Data Abstraction, and Polymorphism”;
1985
“Functional Programming with Bananas, Lenses, Envelopes and Barbed Wire”
“A Semantics of Multiple Inheritance”;
1988
“Typeful Programming”;
1989
“A New Definition of the Subtype Relation”;
1993;
“Behavioral Subtyping Using Invariants and Constraints”;
1999;
CMU-CS-99-156;
“A Formulation of the Simple Theory of Types”;
1940
“COMMON LISP: A Gentle Introduction to Symbolic Computation”;
Carnegie Mellon University;
1989
“Algebra of Programming using Dependent Types”
“Declaring and Checking Non-null Types in an Object-Oriented Language”;
Microsoft Research
“Dependent Classes”;
Technische Universität Darmstadt, Germany
“Generalized Algebraic Data Types and Object-Oriented Programming”;
Microsoft Research
“Generics of a Higher Kind”
“History of Lambda-calculus and Combinatory Logic”;
2006;
Swansea University Mathematics Department Research Report
“Idioms are oblivious, arrows are meticulous, monads are promiscuous”;
Laboratory for Foundations of Computer Science;
University of Edinburgh
“Inheritance Is Not Subtyping”;
Hewlett-Packard Laboratories
“Lambda - The Ultimate Imperative”;
1976
“LambdaPi - An Implementation of a Dependently Typed Lambda Calculus”;
2008
“Logic for Philosophy”;
2007
“Monads for functional programming”;
University of Glasgow
“Notes on Simply Typed Lambda Calculus”;
1998
“On Decidability of Nominal Subtyping with Variance”;
Microsoft Research
“On the Expressive Power of Programming Languages”;
Department of Computer Science Rice University
“Programming Languages: Application and Interpretation”;
Brown University;
2003
“S-Expressions, Parsing, and Unparsing”;
Wellesley College;
2003
“Strong Static Type Checking for Functional Common Lisp”;
1993
“Why Functional Programming Matters”;
Institutionen för Datavetenskap, Chalmers
“The essence of functional programming”;
1992;
University of Glasgow
“Type Systems for Programming Languages”;
2000
“Type Theory & Functional Programming”;
Computing Laboratory, University of Kent;
1999
“Variance and Generalized Constraints for C# Generics”;
Microsoft Research
“The expression problem, Scandinavian style”;
Dept. of Computer Science, University of Aarhus, Denmark
“The Design and Implementation of Typed Scheme”
“Advanced Macrology and the Implementation of Typed Scheme”
“The Haskell Road to Logic, Math and Programming”;
2004
“The Undecidability of λ-Definability”;
Oxford University
“What is a Purely Functional Language?”