yusuke1997/dblp-id-title huggingface dataset:
Programming language semantics: It's easy as 1,2,3
How to look busy while being as lazy as ever: the implementation of a lazy functional debugger
An Overview of the Flagship System
Programming with ornaments
Coherence of subsumption for monadic types
Correspondence assertions for process synchronization in concurrent communications
Refactoring tools for functional languages
Fair enumeration combinators
Parameterized cast calculi and reusable meta-theory for gradually typed lambda calculi
A Run-Time Algorithm for Managing the Granularity of Parallel Functional Programs
Yet Yet a Counterexample for lambda + SP
Manufacturing datatypes
Finally tagless, partially evaluated: Tagless staged interpreters for simpler typed languages
The Third Homomorphism Theorem
Functional Unparsing
Why the Constant 'Undefined'? Logics of Partial Terms for Strict and Non-Strict Functional Programming Languages
An algebra for distributed Big Data analytics
Purely functional lazy nondeterministic programming
No value restriction is needed for algebraic effects and handlers
Read/write factorizable programs
Persistent triangulations Journal of Functional Programming
"Proof, Language and Interaction, Essays in Honour of Robin Milner" by Gordon Plotkin, Colin Sterling and Mads Tofte (eds.), Foundations of Computing Series, MIT Press 2000
A contextual formalization of structural coinduction
Proof-Directed Debugging
Theoretical Pearls
Deriving Tidy Drawings of Trees
Trace contracts
Binary search - think positive
Control reduction theories: the benefit of structural substitution
The Minout Problem
Dynamic witnesses for static type errors (or, Ill-Typed Programs Usually Go Wrong)
Modular development of certified program verifiers with a proof assistant,
Teaching Functional Programming to First-Year Students
OCaml Blockly
From natural semantics to C: A formal derivation of two STG machines
Explicit effect subtyping
Residual Theory in lambda-Calculus: A Formal Development
Shrinking lambda Expressions in Linear Time
Termination of rewriting in the Calculus of Constructions
Programming graphical user interfaces with Scheme
The calculus of dependent lambda eliminations
Steps in Scala: An introduction to Object-Functional Programming By Loverdos, Apostolos Syropoulos, Cambridge University Press, 2010, 504 pp, ISBN 0521747589
A monadic framework for delimited continuations
On the Equivalence Between CMC and TIM
"An Introduction to Computing with Haskell" by Manuel M. T. Chakravarty and Gabrielle C. Keller, Pearson SprintPrint, 2002, ISBN 1 74009 404 2
Remarks on the equational theory of non-normalizing pure type systems
Contract lenses: Reasoning about bidirectional programs via calculation
Algebraic effects and handlers for arrows
An induction principle for nested datatypes in intensional type theory
On the Generation of Specializers
Hoare type theory, polymorphism and separation
Notions of computation as monoids
Solving the snake cube puzzle in Haskell
Interfaces for stack inspection
Haskell 98 Libraries: Random Numbers
Applicative bidirectional programming: Mixing lenses and semantic bidirectionalization
The Hough transform
Improving Intervals
An extended comparative study of language support for generic programming
Pure iso-type systems
Building reliable, high-performance networks with the Nuprl proof development system
A Debugger for Standard ML
Simple and Efficient Purely Functional Queues and Deques
How to think about algorithms , by Jeff Edmonds, Cambridge University Press, ISBN 0521614104
Weaving a web
TinkerType: a language for playing with formal systems
Church numerals, twice!
The Functional "C" experience
Grammatical Framework
Special Issue Dedicated to ICFP 2008 Editorial
Back to futures
Systematic Program Design: From Clarity to Efficiency , by Yanhong Annie Liu, Cambridge University Press, 2013, ISBN: 978-1-107-03660-4
Haskell 98 Libraries: Arrays
Eliminating dependent pattern matching without K
Two-level types and parameterized modules
A library for polymorphic dynamic typing
More Haste, Less Speed: Lazy Versus Eager Evaluation
A SQL to C compiler in 500 lines of code
JFP special issue on program calculation
Theoretical Pearl: An adequate and efficient left-associated binary numeral system in the Lambda-calculus
Quick specifications for the busy programmer
Iterating on multiple collections in synchrony
ANF preserves dependent types up to extensional equality
The view from the left
A Confluent Reduction for the lambda-Calculus with Surjective Pairing and Terminal Object
CPS transformation of flow information
Point-free calculational proofs and program derivation in linear algebra using a graphical syntax
Emerging languages: An alternative approach to teaching programming languages
Recursive subtyping for all
Strong Normalisation for the Linear Term Calculus
Modal FRP for all: Functional reactive programming without space leaks in Haskell
Big-step normalisation
CUFP'13 scribe's report
Systematic abstraction of abstract machines
Building language towers with Ziggurat
Calculating PSSM probabilities with lazy dynamic programming
A Functional Description of TEX's Formula Layout
Haskell 98 Libraries: Maybe Utilities
Choice trees: Representing and reasoning about nondeterministic, recursive, and impure programs in Rocq
Implicitly threaded parallelism in Manticore
Classical Logic, Continuation Semantics and Abstract Machines
Special Issue on Programming Languages for Big Data Editorial
Quantitative static analysis of distributed systems
Deletion: The curse of the red-black tree
The Bird Tree
Review of "Algorithm Design with Haskell" by Richard Bird and Jeremy Gibbons, Cambridge University Press, 2020
A Critique of Standard ML
The full-reducing Krivine abstract machine KN simulates pure normal-order reduction in lockstep: A proof via corresponding calculus
Note on Algol and Conservatively Extending Functional Programming
Haskell 98: Specification of Derived Instances
Forms/3: A first-order visual language to explore the boundaries of the spreadsheet paradigm
"Language-Based Security"
Special issue on functional pearls Editorial
Domain-specific tensor languages
Using randomization to make recursive matrix algorithms practical
Modularity of Strong Normalization in the Algebraic-lambda-Cube
A Pointless Derivation of Radix Sort
Enumerating the strings of regular languages
Review of "Functional and Reactive Domain Modeling" by Debasish Ghosh, Manning, 2017, ISBN 978-1-617-29224-8
A Paradigmatic Object-Oriented Programming Language: Design, Static Typing and Semantics
Intensional polymorphism in type-erasure semantics
Introduction to Generalized Type Systems
Regular expression filters for XML
Iris from the ground up: A modular foundation for higher-order concurrent separation logic
Parallelizing functional programs by generalization
Review of "Haskell in Depth" by Vitaly Bragilevsky, Manning Publications, 2021
Ready, Set, Verify! Applying hs-to-coq to real-world Haskell code
Mtac: A monad for typed tactic programming in Coq
Inlining as staged computation
A monadic analysis of information flow security with mutable state
Pipelined functional tree accesses and updates: scheduling, synchronization, caching and coherence
Short note: Strict unwraps make worker/wrapper fusion totally correct
Ghostbuster: A tool for simplifying and converting GADTs
A Categorical Understanding of Environment Machines
Correctness of Binding-Time Analysis
On Removing Duplicates
Efficient Graph Algorithms Using Lazy Monolithic Arrays
FUNCTIONAL PEARL. Proof-directed debugging - Corrigendum
"Concepts in Programming Languages" by John C. Mitchell, Cambridge University Press, 2002, ISBN 0-521-78098-5
A predicative approach to the classification problem
The lambda-calculus with constructors: Syntax, confluence and separation
Protocol combinators for modeling, testing, and execution of distributed systems
Functional programming with the FC++ library
The risks and benefits of teaching purely functional programming in first year
New Dimensions in Heap Profiling
Towards type-directed compiler calculation
Haskell 98: Predefined Types and Classes
NixOS: A purely functional Linux distribution
Editorial for the Special Issue on Parallel and Concurrent Functional Programming
Deduction for Functional Programmers
Explainable dynamic programming
Building Web Applications with Erlang , by Zachary Kessin, O'Reilly Media, Inc., 2012, ISBN 97-81-4493-20652
Automatically testing console I/O behavior of student submissions in Haskell
Commercial users of functional programming workshop report
Haskell 98 Libraries: Bibliography
Types and trace effects of higher order programs
Non-determinism analyses in a parallel-functional language
Program equivalence in a linear functional language
Explaining Binomial Heaps
Partially Strict Non-Recursive Data Types
Recursive subtyping revealed
Constructed product result analysis for Haskell
Retrieving Reusable Software Components by Polymorphic Type
Promoting rewriting to a programming language: a compiler for non-deterministic rewrite programs in associative-commutative theories
Review of "The Little Prover" by Daniel P. Friedman and Carl Eastlund, MIT Press, 2015
Transparent fault tolerance for scalable functional computation
"Essentials of Programming Languages" (2nd ed) by Daniel P. Friedman, Mitchell Wand and Christopher T. Haynes, MIT Press, ISBN 0-262-06217-8, 2001
Type and Behaviour Reconstruction for Higher-Order Concurrent Programs
Formal Basis for the Refinement of Rule Based Transition Systems
SMIL 2.0 Interactive Multimedia for Web and Mobile Devices by C. A. Dick Bulterman and Lloyd Rutledge, Springer X.media.publishing, 2004, 440pp, ISBN 3-540-20234-X
Distributed communication in ML
Concurrent distinct choices
Exceptional Syntax Journal of Functional Programming
Proof-Irrelevance out of Exluded-Middle and Choice in the Calculus of Constructions
De Bruijn Notation as a Nested Datatype
A simple blame calculus for explicit nulls
Modular lazy search for Constraint Satisfaction Problems
Thinking Functionally with Haskell by Richard Bird, Cambridge University Press, 2014
EQUALS - A Fast Parallel Implementation of a Lazy Language
Program Transformation with Metasystem Transitions
Special Issue on State-of-the-Art Applications of Pure Functional Programming Languages
Haskell 98 Libraries: Rational Numbers
Functional Design and Implementation of Graphical User Interfaces for Theorem Provers
The graphical theory of monads
A calculus with polymorphic and polyvariant flow types
Combinators for Program Generation
Efficient parallel and incremental parsing of practical context-free languages
A greedy algorithm for dropping digits
Efficient manipulation of binary data using pattern matching
Essentials of Programming Languages (third edition) by Daniel P. Friedman and Mitchell Wand, MIT Press, ISBN 978-0-262-06279-4, 2008
Folding left and right matters: Direct style, accumulators, and continuations
Linearization of the lambda-calculus and its relation with intersection type systems
Reasoning about multi-stage programs
Algebras for combinatorial search
A practical formalization of monadic equational reasoning in dependent-type theory
Implementing Theorem Provers in a Purely Functional Style
Using Miranda as a First Programming Language
Level-p-complexity of Boolean functions using thinning, memoization, and polynomials
Modular Proof of Strong Normalization for the Calculus of Constructions
A domain-specific language for experimental game theory
Generic top-down discrimination for sorting and partitioning in linear time
Inductive benchmarking for purely functional data structures
COCHIS: Stable and coherent implicits
A Symmetric Set of Efficient List Operations
Romeo: A system for more flexible binding-safe programming
Domain-free pure type systems
Pure Type System conversion is always typable
Worst Case Scheduling for Parallel Functional Programs
Computer literacy via Scheme and web programming
A Coherence Theorem for Martin-Löf's Type Theory
Haskell 98 Libraries: Monad Utilities
Idris, a general-purpose dependently typed programming language: Design and implementation
Higher order functions and Brouwer's thesis
An object-oriented calculus with term constraints
Safe Fusion of Functional Expressions II: Further Improvements
Efficient Analysis for Realistic Off-Line Partial Evaluation
Composing fractals
Set constraints for destructive array update optimization
Semantics Directed Program Execution Monitoring
An insider's look at LF type reconstruction: everything you (n)ever wanted to know
Linear type theory for asynchronous session types
Every bit counts: The binary representation of typed data and programs
From high to low: Simulating nondeterminism and state with state
A Competitive Algorithm for Managing Sharing in the Distributed Execution of Functional Programs
Introduction to the art of programming using Scala , by Mark C. Lewis, Chapman and Hall/CRC Press, 2012, £ 46.99 (paperback) ISBN-10: 1439896666
Efficient execution in an automated reasoning environment
Special issue on 'Logical frameworks and metalanguages'
Stack-based typed assembly language
Many more predecessors: A representation workout
OCaml-Java: The Java Virtual Machine as the target of an OCaml compiler
Type-safe run-time polytypic programming
Functional Pearl: Marble mingling
Functional Pearl: A program to solve Sudoku
An in-situ algorithm for expanding a graph
Pattern Matching with Abstract Data Types
Lightweight checkpointing for concurrent ML
Comparing Id and Haskell in a Monte Carlo Photon Transport Code
Container types categorically
Monadic encapsulation of effects: a revised approach (extended version)
Weak Polymorphism can be Sound
Special Issue on Run-Time Systems and Target Platforms for Functional Languages: Editorial
Counting and generating lambda terms
Extended Natural Semantics
What is an education paper?
Building a consensus: A rectangle covering problem
Dependent types ensure partial correctness of theorem provers
Typed quote/antiquote or: Compile-time parsing
Inductive Synthesis of Functional Programs by U. Schmid, Springer Verlag, 2003, 420pp, ISBN 3540401741
Delimited control and computational effects
A fresh look at binary search trees
VoDKA: Developing a Video-on-Demand Server using Distributed Functional Programming
Experience report: Functional programming in C-Rules
Faking it: Simulating dependent types in Haskell
Haskell 98: Modules
Shifting the stage - Staging with delimited control
Fault-tolerant functional reactive programming (extended version)
Linear lambda calculus and PTIME-completeness
Review of "Thinking with Types"* by Sandy Maguire, LeanPub, 2019
CUFP 2011 Workshop Report
When Maybe is not good enough
Static Blame for gradual typing
Diets for Fat Sets
Educational Pearl: Biological sequence similarity
Translation of tree-processing programs into stream-processing programs based on ordered linear type
Oracle-guided scheduling for controlling granularity in implicitly parallel languages
Global variables in Haskell
Haskell 98 Libraries: Locales
Programming Languages and Operational Semantics by Fernández Maribel, King's College Publications, 2004, ISBN 0954300637
Concrete stream calculus: An extended study
Benchmarking Implementations of Functional Languages with 'Pseudoknot', a Float-Intensive Benchmark
Compiling lazy functional programs for the Java Virtual Machine
Is sized typing for Coq practical?
Deriving a Lazy Abstract Machine
Segments: An alternative rainfall problem
Verification of Reactive Systems by Klaus Schneider Springer Verlag, 2003, 600pp, ISBN 3-540-00296-0
Special issue on Programming with Dependent Types Editorial
Haskell 98: Compiler Pragmas
A Poor Man's Concurrency Monad
The Resource Constrained Shortest Path Problem Implemented in a Lazy Functional Language
Review of "Algorithms for Functional Programming" by John David Stone, Springer-Verlag, 2018
A Type-Based Escape Analysis for Functional Languages
Parallel Parsing Processes
Special issue dedicated to ICFP 2014: Editorial
Fregel: a functional domain-specific language for vertex-centric large-scale graph processing
lambda-nu, A Calculus of Explicit Substitutions which Preserves Strong Normalisation
Categorical semantics for arrows
Parberry's pairwise sorting network revealed
Compilation of a specialized functional language for massively parallel computers
How to mingle streams
First-class patterns
A fully adequate shallow embedding of the [pi]-calculus in Isabelle/HOL with mechanized syntax analysis
Enumerators of lambda Terms are Reducing
On Combinatory Complete Sets of Proper Combinators
Generalized monoidal effects and handlers
Formal polytypic programs and proofs
Contributions to a computational theory of policy advice and avoidability
The countdown problem
Abstract allocation as a unified approach to polyvariance in control-flow analyses
Functional chart parsing of context-free grammars
Composable scheduler activations for Haskell
A Polymorphic Library for Constructive Solid Geometry
1ML - Core and modules united
Linear lambda terms as invariants of rooted trivalent maps
First-Order Functional Languages and Intensional Logic
Pushdown flow analysis with abstract garbage collection
Haskell 98 Libraries: CPU Time
Algorithms + Strategy = Parallelism
Higher-Order Functions for Parsing
Bottom-up computation using trees of sublists
A focused solution to the avoidance problem
Software Abstractions: Logic, Language, and Analysis by Daniel Jackson, The MIT Press, 2006, 366pp, ISBN 978-0262101141
"Little language" project modules
Efficient Sets - A Balancing Act
A unified treatment of syntax with binders
Haskore Music Notation - An Algebra of Music
Functional Programming for Java Developers - Tools for Better Concurrency, Abstraction, and Agility , By Wampler, Media, July 2011, ISBN-13: 978-1449311032, 90pp
On the Specialization of Online Program Specializers
Boxes go bananas: Encoding higher-order abstract syntax with parametric polymorphism
A representation theorem for second-order functionals
Transformation techniques for context-sensitive rewrite systems
Parallelization of Divide-and-Conquer by Translation to Nested Loops
Unifying structured recursion schemes - An Extended Study
Caml trading - experiences with functional programming on Wall Street
Functional Runtime Systems Within the Lambda-Sigma Calculus
StkTokens: Enforcing well-bracketed control flow and stack encapsulation using linear capabilities
Operational Interpretations of an Extension of F omega with Control Operators
Escape from Zurg: an exercise in logic programming
"Trends in Functional Programming" (volumes 1 & 2) by Greg Michaelson, Phil Trinder and Hans-Wolfgang Loidl (editors volume 1), and Stephen Gilmore (editor volume 2). Intellect Books, Bristol, 2001, 2002
The Interactive Lazy ML System
More on balanced diets
Review of spreadsheet implementation technology: Basics and extensions, by Peter Sestoft , MIT Press, 2014, ISBN 978-0-262-52664-7
A combinator library for the design of railway track layouts
Real-time MLton: A Standard ML runtime for real-time functional programs
MC 2 A module calculus for Pure Type Systems
MRI: Modular reasoning about interference in incremental programming
Lessons from the Design of a Standard ML Library
A Simple Proof of the Undecidability of Inhabitation in lambda P
An operational semantics for Scheme
A well-known representation of monoids and its application to the function 'vector reverse'
Formalisation in higher-order logic and code generation to functional languages of the Gauss-Jordan algorithm
An Incremental, Exploratory and Transformational Environment for the Lazy Functional Programming
Composable data visualizations
Inverting the Burrows-Wheeler transform
Formatting: a class act
Untyped Strictness Analysis
Implementing a normalizer using sized heterogeneous types
The Virtues of Eta-Expansion
The adequacy of Launchbury's natural semantics for lazy evaluation
Some Lattice-Based Scientific Problems, Expressed in Haskell
Dynamic Typing in Polymorphic Languages
Consistency of the theory of contexts
On bunched typing
Extensional equality preservation and verified generic programming
Work it, wrap it, fix it, fold it
Haskell 98 Libraries: Dates and Times
Deciding Type Isomorphisms in a Type-Assignment Framework
Doo bee doo bee doo
Review: Lambda-Calculus and Combinators: An Introduction , Second Edition by J. R. Hindley and J. P. Seldin
A simple library implementation of binary sessions
A consistent semantics of self-adjusting computation
Implementing Lazy Functional Languages on Stock Hardware: The Spineless Tagless G-Machine
On the expressive power of user-defined effects: Effect handlers, monadic reflection, delimited control
The Semantics of Future and an Application
Haskell 98 Libraries: Indexing Operations
Preface for special section from FLOPS 2014
Functional Pearls: Finding celebrities: A lesson in functional programming
Parallel functional programming in Eden
Efficient Self-Interpretations in lambda Calculus
Functional satisfaction
Meertens Number
Fold-unfold lemmas for reasoning about recursive programs using the Coq proof assistant
Counting and generating terms in the binary lambda calculus
The Complexity of Type Inference for Higher-Order Typed lambda Calculi
Longest segment of balanced parentheses: an exercise in program inversion in a segment problem
The logic of demand in Haskell
Effect handlers via generalised continuations
AutoBayes: a system for generating data analysis programs from statistical models
A predicative analysis of structural recursion
From ML to Ada: Strongly-Typed Language Interoperability via Source Translation
Push versus pull-based loop fusion in query engines
Refining Reduction in the Lambda Calculus
A compiled implementation of normalisation by evaluation
Call-by-name extensionality and confluence
Theoretical Pearl: A simple proof of a folklore theorem about delimited control
Loci: a rule-based framework for parallel multi-disciplinary simulation synthesis
Haskell 98: Standard Prelude
A note on the genuine Sieve of Eratosthenes
Haskell 98 Libraries: Character Utilities
An Unsolvable Numeral System in lambda Calculus
From Polyvariant flow information to intersection and union types
Practical type inference for arbitrary-rank types
Functional Pearls: The Last Tail
Automatic Verification of Functions with Accumulating Parameters
The Fun of Programming edited by Jeremy Gibbons and Oege de Moor, Palgrave Macmillan, 2003
PAEAN: Portable and scalable runtime support for parallel Haskell dialects
Pure type systems with judgemental equality
Algorithms with polynomial interpretation termination proof
On characterizations of the basic feasible functionals (Part I)
Automatic useless-code elimination for HOT functional programs
Systematic identification and communication of type errors
Monadic constraint programming
Computation semantics of the functional scientific workflow language Cuneiform
Type-checking multi-parameter type classes
POPLMark reloaded: Mechanizing proofs by logical relations
Super-naturals
Total Unfolding: Theory and Applications
Send to me first: Priority in synchronous message-passing
Noninterference through flow analysis
Equivalence in Functional Languages with Effects
Compiling embedded languages
Functional Pearl: Enumerating the rationals
Bookreview JFP: Domain-Specific Languages by Martin Fowler The Addison Wesley Signature Series
Acute: High-level programming language design for distributed computation
Animated Fuzzy Logic
Backtracking with cut via a distributive law and left-zero monoids
Dynamic rebinding for marshalling and update, via redex-time and destruct-time reduction
Educational Pearl: 'Proof-directed debugging' revisited for a first-order version
Taming the Merge Operator
Faster coroutine pipelines: A reconstruction
Unravelling Greedy Algorithms
Parameterised notions of computation
Two Greedy Algorithms
PAL + : a lambda-free logical framework
Lambda and pi calculi, CAM and SECD machines
Shared memory multiprocessor support for functional array processing in SAC
The structure and interpretation of the computer science curriculum
Effekt: Capability-passing style for type- and effect-safe, extensible effect handlers in Scala
Balancing weight-balanced trees
How Powerful are Folding/Unfolding Transformations?
Parallel Functional Programming on Recursively Defined Data via Data-Parallel Recursion
Normal-order reduction grammars