GitHub - bitemyapp/papers

Name		Name	Last commit message	Last commit date
A Brief Introduction to VRML.pdf		A Brief Introduction to VRML.pdf
A Comprehensive Study of Convergent and Commutative Replicated Data Types.pdf		A Comprehensive Study of Convergent and Commutative Replicated Data Types.pdf
A Concurrency Monad Based on Constructor Primitives.pdf		A Concurrency Monad Based on Constructor Primitives.pdf
A Direct Algorithm for Type Inference in the Rank 2 Fragment of the Second-Order Lambda-Calculus.pdf		A Direct Algorithm for Type Inference in the Rank 2 Fragment of the Second-Order Lambda-Calculus.pdf
A Generic Abstract Syntax Model for Embedded Languages.pdf		A Generic Abstract Syntax Model for Embedded Languages.pdf
A Generic Deriving Mechanism for Haskell.pdf		A Generic Deriving Mechanism for Haskell.pdf
A Lattice Theoretical Approach to Determistic Parallelism with Shared State.pdf		A Lattice Theoretical Approach to Determistic Parallelism with Shared State.pdf
A Library for Light-Weight Information-Flow Security in Haskell.pdf		A Library for Light-Weight Information-Flow Security in Haskell.pdf
A Library for Secure Multi-threaded Information Flow in Haskell .pdf		A Library for Secure Multi-threaded Information Flow in Haskell .pdf
A Model of Type Theory in Cubical Sets.pdf		A Model of Type Theory in Cubical Sets.pdf
A New Notation for Arrows.pdf		A New Notation for Arrows.pdf
A Notation for Comonads.pdf		A Notation for Comonads.pdf
A Poor Man's Concurrency Monad.pdf		A Poor Man's Concurrency Monad.pdf
A Primer on Separation Logic (and Automatic Program Verification and Analysis).pdf		A Primer on Separation Logic (and Automatic Program Verification and Analysis).pdf
A Relational Framework for Higher-Order Shape Analysis.pdf		A Relational Framework for Higher-Order Shape Analysis.pdf
A Seamless, Client-Centric Programming Model for Type Safe Web Applications.pdf		A Seamless, Client-Centric Programming Model for Type Safe Web Applications.pdf
A Simple Semantics for Haskell Overloading.pdf		A Simple Semantics for Haskell Overloading.pdf
A Term Calculus for Intuitionistic Linear Logic.pdf		A Term Calculus for Intuitionistic Linear Logic.pdf
A Theory of Gradual Effect Systems.pdf		A Theory of Gradual Effect Systems.pdf
A Theory of Information-Flow Labels.pdf		A Theory of Information-Flow Labels.pdf
A Verified Information-Flow Architecture.pdf		A Verified Information-Flow Architecture.pdf
Algebraic Effects and Effect Handlers for Idioms and Arrows.pdf		Algebraic Effects and Effect Handlers for Idioms and Arrows.pdf
An Elementary Illustrated Introduction to Simplical Sets.pdf		An Elementary Illustrated Introduction to Simplical Sets.pdf
An Introduction to Braid Theory.pdf		An Introduction to Braid Theory.pdf
An Introduction to n-Categories.pdf		An Introduction to n-Categories.pdf
Applicative Programming with Effects.pdf		Applicative Programming with Effects.pdf
Arity-Generic Datatype-Generic Programming.pdf		Arity-Generic Datatype-Generic Programming.pdf
Arrows are Strong Monads.pdf		Arrows are Strong Monads.pdf
Arrows, Like Monads, Are Monoids.pdf		Arrows, Like Monads, Are Monoids.pdf
Asymptotic Improvement of Computations Over Free Monads.pdf		Asymptotic Improvement of Computations Over Free Monads.pdf
Backtracking, Interleaving, and Terminating Monad Transformers.pdf		Backtracking, Interleaving, and Terminating Monad Transformers.pdf
Behavioral Software Contracts.pdf		Behavioral Software Contracts.pdf
Bidirectionalization for Free! (Functional Pearl).pdf		Bidirectionalization for Free! (Functional Pearl).pdf
Binders Unbound.pdf		Binders Unbound.pdf
Bitcoin: A Peer-to-Peer Electronic Cash System.pdf		Bitcoin: A Peer-to-Peer Electronic Cash System.pdf
Building Embedded Systems with Embedded DSLs.pdf		Building Embedded Systems with Embedded DSLs.pdf
Building Secure systems with LIO (Demo).pdf		Building Secure systems with LIO (Demo).pdf
Bunching for Regions and Locations.pdf		Bunching for Regions and Locations.pdf
Cache Oblivious Algorithms.pdf		Cache Oblivious Algorithms.pdf
Call Arity.pdf		Call Arity.pdf
Categorical Semantics for Arrows.pdf		Categorical Semantics for Arrows.pdf
Causal Commutative Arrows and their Optimizations.pdf		Causal Commutative Arrows and their Optimizations.pdf
Causality for Free! Parametricity Implies Causality for Functional Reactive Programming.pdf		Causality for Free! Parametricity Implies Causality for Functional Reactive Programming.pdf
Cheap (But Functional) Threads.pdf		Cheap (But Functional) Threads.pdf
Closed Freyd- and Kappa-Categories.pdf		Closed Freyd- and Kappa-Categories.pdf
Closed Type Families with Overlapping Equations (Extendend).pdf		Closed Type Families with Overlapping Equations (Extendend).pdf
Clowns to the Left of Me, Jokers to the Right: Dissecting Data Structures.pdf		Clowns to the Left of Me, Jokers to the Right: Dissecting Data Structures.pdf
Codata and Comonads in Haskell.pdf		Codata and Comonads in Haskell.pdf
Coeffects: A Calculus of Context-Dependent Computation.pdf		Coeffects: A Calculus of Context-Dependent Computation.pdf
Coeffects: Unified Static Analysis of Context-Dependence.pdf		Coeffects: Unified Static Analysis of Context-Dependence.pdf
Combinator Parsers: From Toys to Tools.pdf		Combinator Parsers: From Toys to Tools.pdf
Combinator Parsing: A Short Tutorial.pdf		Combinator Parsing: A Short Tutorial.pdf
Combining Events and Threads for Scalable Network Services: Implementation and Evaluation of Monadic, Application-Level Concurrency Primitives.pdf		Combining Events and Threads for Scalable Network Services: Implementation and Evaluation of Monadic, Application-Level Concurrency Primitives.pdf
Combining Monads.pdf		Combining Monads.pdf
Comonadic Notions of Computation.pdf		Comonadic Notions of Computation.pdf
Comonads for Grad Students.pdf		Comonads for Grad Students.pdf
Compiling with Continuations, Continued.pdf		Compiling with Continuations, Continued.pdf
Composing and Decomposing Data Types: A Closed Type Families Implementation of Data Types a la Carte.pdf		Composing and Decomposing Data Types: A Closed Type Families Implementation of Data Types a la Carte.pdf
Compositional Data Types.pdf		Compositional Data Types.pdf
Compositional Semantics for Composable Continuations.pdf		Compositional Semantics for Composable Continuations.pdf
Comprehending Monads.pdf		Comprehending Monads.pdf
Computational Lambda-Calculus and Monads.pdf		Computational Lambda-Calculus and Monads.pdf
Concurrent NetCore: From Policies to Pipelines.pdf		Concurrent NetCore: From Policies to Pipelines.pdf
Conflict-free Replicated Data Types.pdf		Conflict-free Replicated Data Types.pdf
Cons Should Not Evaluate its Arguments.pdf		Cons Should Not Evaluate its Arguments.pdf
Constructing Applicative Functors.pdf		Constructing Applicative Functors.pdf
Data Types à la Carte.pdf		Data Types à la Carte.pdf
Datatype-Generic Programming.pdf		Datatype-Generic Programming.pdf
Dead Code Elimination Through Dependent Types.pdf		Dead Code Elimination Through Dependent Types.pdf
Delimited Continuations in Haskell.pdf		Delimited Continuations in Haskell.pdf
Denotational Design with Type Class Morphisms.pdf		Denotational Design with Type Class Morphisms.pdf
Dependent Types at Work.pdf		Dependent Types at Work.pdf
Dependently Typed Programming in Agda.pdf		Dependently Typed Programming in Agda.pdf
Dependently Typed Programming with Singletons.pdf		Dependently Typed Programming with Singletons.pdf
Deterministic, Error-Correcting Combinator Parsers.pdf		Deterministic, Error-Correcting Combinator Parsers.pdf
Distributors at Work.pdf		Distributors at Work.pdf
Domain Specific Embedded Compilers.pdf		Domain Specific Embedded Compilers.pdf
Dual Intuitionistic Linear Logic.pdf		Dual Intuitionistic Linear Logic.pdf
Dynamic Typing as Staged Type Inference.pdf		Dynamic Typing as Staged Type Inference.pdf
Effect Handlers in Scope.pdf		Effect Handlers in Scope.pdf
Elementary Strong Functional Programming.pdf		Elementary Strong Functional Programming.pdf
Eliminating Dependent Pattern Matching.pdf		Eliminating Dependent Pattern Matching.pdf
Embedding Effect Systems in Haskell.pdf		Embedding Effect Systems in Haskell.pdf
Encoding Information Flow in Haskell.pdf		Encoding Information Flow in Haskell.pdf
End-to-end Multilevel Hybrid Information Flow Control.pdf		End-to-end Multilevel Hybrid Information Flow Control.pdf
Engineering Proof by Reflection in Agda.pdf		Engineering Proof by Reflection in Agda.pdf
Enumerating the Rationals.pdf		Enumerating the Rationals.pdf
Euclid's Theorem in Agda.pdf		Euclid's Theorem in Agda.pdf
Exploring the Regular Trees.pdf		Exploring the Regular Trees.pdf
Extensible Denotational Language Specifications.pdf		Extensible Denotational Language Specifications.pdf
Extensible Effects: An Alternative to Monad Transformers.pdf		Extensible Effects: An Alternative to Monad Transformers.pdf
F-ing Modules.pdf		F-ing Modules.pdf
FEAT: Functional Enumeration of Algebraic Types.pdf		FEAT: Functional Enumeration of Algebraic Types.pdf
Fast, Error Correcting Parser Combinators: A Short Tutorial.pdf		Fast, Error Correcting Parser Combinators: A Short Tutorial.pdf
First-class Isomorphic Specialization by Staged Evaluation.pdf		First-class Isomorphic Specialization by Staged Evaluation.pdf
Fixing Idioms.pdf		Fixing Idioms.pdf
Flexible Dynamic Information Flow Control in Haskell.pdf		Flexible Dynamic Information Flow Control in Haskell.pdf
Focusing on Binding and Computation.pdf		Focusing on Binding and Computation.pdf
Focusing on Pattern Matching.pdf		Focusing on Pattern Matching.pdf
Folding Domain-Specific Languages: Deep and Shallow Embeddings.pdf		Folding Domain-Specific Languages: Deep and Shallow Embeddings.pdf

Latest commit

History

Folders and files

About

Stars

Watchers

Forks

Releases

Packages

Contributors