Results 41 to 50 of about 82,171 (148)

Parsing Expression Grammars Made Practical

, 2015
Parsing Expression Grammars (PEGs) define languages by specifying recursive-descent parser that recognises them. The PEG formalism exhibits desirable properties, such as closure under composition, built-in disambiguation, unification of syntactic and ...
Laurent, Nicolas, Mens, Kim
core   +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  

Meta-F*: Proof Automation with SMT, Tactics, and Metaprograms

, 2019
We introduce Meta-F*, a tactics and metaprogramming framework for the F* program verifier. The main novelty of Meta-F* is allowing the use of tactics and metaprogramming to discharge assertions not solvable by SMT, or to just simplify them into well ...
Ahman, Danel, Dumitrescu, Victor, Giannarakis, Nick, Hawblitzel, Chris, Hritcu, Catalin, Martínez, Guido, Narasimhamurthy, Monal, Paraskevopoulou, Zoe, Pit-Claudel, Clément, Protzenko, Jonathan, Ramananandro, Tahina, Rastogi, Aseem, Swamy, Nikhil   +12 more
core   +2 more sources

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, Jansson, Patrik, Wang, Meng   +2 more
core   +2 more sources

Combining Czech Dependency Parsers [PDF]

, 2006
In this paper we describe in detail two dependency parsing techniques developed and evaluated using the Prague Dependency Treebank 2.0 Then we propose two approaches for combining various existing parsers in order to obtain better accuracy The highest parsing accuracy reported in this paper is 85.84 %, which represents 1.86 % improvement compared to ...
Tomáš Holan, Zdeněk Žabokrtský
openaire   +1 more source

How functional programming mattered [PDF]

, 2015
In 1989 when functional programming was still considered a niche topic, Hughes wrote a visionary paper arguing convincingly ‘why functional programming matters’. More than two decades have passed. Has functional programming really mattered? Our answer is
Abelson, Armstrong, Armstrong, Arts, Arts, Axelsson, Baars, Backus, Bahr, Barthe, Bertot, Bird, Bird, Bird, Bird, Bird RS Moor, Blelloch, Blelloch, Bringert, Carette, Chakravarty, Chakravarty MMT Leshchinskiy, Chetali, Chin, Claessen, Claessen, Cole, Cole, de Moor, Dean, Devriese, Dijkstra, Dybvig, Elliott, Elliott, Epstein, Farmer, Fegaras, Felleisen, Ford, Gibbons, Gibbons, Gill, Halloway, Hammond, Hansen MR Rischel, Harris, Hinze, Hinze, Hu, Hu, Hu, Hu, Hu, Hudak, Hudak, Hudak, Hudak, Hudak, Hudak, Hughes, Hughes, Hughes, Hughes JM Bolinder, Hutton, Hutton, Jones, Katayama, Katayama, Kiselyov, Launchbury, Launchbury, Leijen, Leroy, Liang, Lindley, Loidl HW Rubio, Matsuzaki, Mcbride, Meijer, Meijer, Milner, Minsky, Minsky, Moggi, Moggi, Morita, Mu, Naiman, Norell, Odersky, Oliveira BCS Moors, Paterson, Paulson, Persson, Peyton Jones, Peyton Jones, Peyton Jones SL Wadler, Reynolds, Sagonas, Schrijvers, Sculthorpe, Seibel, Sheard, Skillicorn, Smith, Snyder, Steele, Steele, Svenningsson, Svenningsson, Swierstra, Swierstra SD Duponcheel, Takano, Takano, Tesson, Wadler, Wadler, Wadler, Wadler, Wampler, Yang   +121 more
core   +1 more source

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, C. McBride, J. Hughes, J. Lambek, J. Voigtländer, K. Matlage, M. Abbott, P. Johann, P. Wadler, R. Atkey, R. Hinze, S.D. Swierstra, S.M. Lane   +12 more
core   +2 more sources

A typed, algebraic approach to parsing

ACM-SIGPLAN Symposium on Programming Language Design and Implementation, 2019
In this paper, we recall the definition of the context-free expressions (or µ-regular expressions), an algebraic presentation of the context-free languages.
N. Krishnaswami, J. Yallop
semanticscholar   +1 more source

cclib 2.0: An updated architecture for interoperable computational chemistry.

Journal of Chemical Physics
Interoperability in computational chemistry is elusive, impeded by the independent development of software packages and idiosyncratic nature of their output files.
Eric J. Berquist, Amanda Dumi, Shiv Upadhyay, Omri D Abarbanel, Minsik Cho, Sagar Gaur, Victor Hugo Cano Gil, Geoffrey R Hutchison, Oliver S Lee, Andrew S. Rosen, Sanjeed Schamnad, Felipe S. S. Schneider, Casper Steinmann, M. Stolyarchuk, Jonathon E. Vandezande, Weronika Zak, Karol M Langner   +16 more
semanticscholar   +1 more source

Constraint Generation for the Jeeves Privacy Language [PDF]

, 2014
Our goal is to present a completed, semantic formalization of the Jeeves privacy language evaluation engine, based on the original Jeeves constraint semantics defined by Yang et al at POPL12, but sufficiently strong to support a first complete ...
Rose, Eva
core