Results 31 to 40 of about 1,131 (104)
Staged parser combinators for efficient data processing [PDF]
ACM SIGPLAN Notices, 2014 Parsers are ubiquitous in computing, and many applications depend on their performance for decoding data efficiently. Parser combinators are an intuitive tool for writing parsers: tight integration with the host language enables grammar specifications to be interleaved with processing of parse results.
Manohar Jonnalagedda +4 more
openaire +1 more source
Higher-Order Functions for Parsing [PDF]
, 1992 In combinator parsing, the text of parsers resembles BNF notation. We present the basic method, and a number of extensions. We address the special problems presented by white-space, and parsers with separate lexical and syntactic phases. In particular,
Hutton, Graham
core
'Galculator': functional prototype of a Galois-connection based proof assistant [PDF]
, 2008 Galculator is the name of the prototype of a proof assistant of a special brand: it is solely based on the algebra of Galois connections. When combined with the pointfree transform and tactics such as the indirect equality principle, Galois connections ...
Oliveira, José Nuno Fonseca +1 more
core +1 more source
Session Type Inference in Haskell
, 2011 We present an inference system for a version of the Pi-calculus in Haskell for the session type proposed by Honda et al. The session type is very useful in checking if the communications are well-behaved.
Agusa, Kiyoshi, Imai, Keigo, Yuen, Shoji
core +2 more sources
Constructing applicative functors [PDF]
, 2012 Applicative functors define an interface to computation that is more general, and correspondingly weaker, than that of monads. First used in parser libraries, they are now seeing a wide range of applications.
A.I. Baars +12 more
core +2 more sources
User-friendly Support for Common Concepts in a Lightweight Verifier [PDF]
, 2010 Machine verification of formal arguments can only increase our confidence in the correctness of those arguments, but the costs of employing machine verification still outweigh the benefits for some common kinds of formal reasoning activities. As a result,
Lapets, Andrei
core +1 more source
Feat: Functional Enumeration of Algebraic Types [PDF]
, 2012 In mathematics, an enumeration of a set S is a bijective function from (an initial segment of) the natural numbers to S. We define "functional enumerations" as efficiently computable such bijections.
Duregard, Jonas +2 more
core +2 more sources
Parsley: optimising and improving parser combinators
, 2023 Parser combinators are a functional abstraction for parsing that abstracts hand-written recursive-descent parsers behind a high-level set of combinators. While these kinds of parsers are popular in the functional programming community, they have been historically criticised: * Parser combinator performance is sub-par compared with handwritten parsers. *
openaire +2 more sources
A new view on parser combinators
Proceedings of the 31st Symposium on Implementation and Application of Functional Languages, 2019 Parser combinators offer a concise and fast way to produce reasonably efficient parsers. The combinator libraries themselves can be small and provide an elegant application of functional programming techniques. They are one of the success stories in functional programming that are also ported to many other languages.
Koopman, P.W.M., Plasmeijer, M.J.
openaire +2 more sources
An implementation of Deflate in Coq
, 2016 The widely-used compression format "Deflate" is defined in RFC 1951 and is based on prefix-free codings and backreferences. There are unclear points about the way these codings are specified, and several sources for confusion in the standard. We tried to
AW Appel +9 more
core +1 more source