Results 31 to 40 of about 80,039 (149)

Memoizing a monadic mixin DSL [PDF]

, 2011
Modular extensibility is a highly desirable property of a domain-specific language (DSL): the ability to add new features without affecting the implementation of existing features.
Samulowitz, Horst, Schrijvers, Tom, Stuckey, Peter, Tack, Guido, Wuille, Pieter   +4 more
core   +1 more source

K-best combination of syntactic parsers [PDF]

Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing Volume 3 - EMNLP '09, 2009
In this paper, we propose a linear model-based general framework to combine k-best parse outputs from multiple parsers. The proposed framework leverages on the strengths of previous system combination and re-ranking techniques in parsing by integrating them into a linear model.
Min Zhang, Hui Zhang, Chew Lim Tan, Haizhou Li   +3 more
openaire   +2 more sources

Matching objects without language extension [PDF]

, 2006
Pattern matching is a powerful programming concept which has proven its merits in declarative programming. The absence of pattern-matching in object-oriented programming languages is felt especially when tackling source code processing problems.
Visser, Joost
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 ...
Zdeněk Žabokrtský, Tomáš Holan
openaire   +2 more sources

Error Reporting in Parsing Expression Grammars

, 2016
Parsing Expression Grammars (PEGs) describe top-down parsers. Unfortunately, the error-reporting techniques used in conventional top-down parsers do not directly apply to parsers based on Parsing Expression Grammars (PEGs), so they have to be somehow ...
Ierusalimschy, Roberto, Maidl, André Murbach, Mascarenhas, Fabio, Medeiros, Sérgio   +3 more
core   +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

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

Certified Context-Free Parsing: A formalisation of Valiant's Algorithm in Agda [PDF]

, 2016
Valiant (1975) has developed an algorithm for recognition of context free languages. As of today, it remains the algorithm with the best asymptotic complexity for this purpose.
Bernardy, Jean-Philippe, Jansson, Patrik
core   +2 more sources

Comparing and combining finite-state and context-free parsers [PDF]

Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing - HLT '05, 2005
In this paper, we look at comparing high-accuracy context-free parsers with high-accuracy finite-state (shallow) parsers on several shallow parsing tasks. We show that previously reported comparisons greatly under-estimated the performance of context-free parsers for these tasks.
Kristy Hollingshead, Seeger Fisher, Brian Roark   +2 more
openaire   +2 more sources

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