Results 61 to 70 of about 82,171 (148)
Towards rule-based visual programming of generic visual systems
, 2000 This paper illustrates how the diagram programming language DiaPlan can be used to program visual systems. DiaPlan is a visual rule-based language that is founded on the computational model of graph transformation.
Hoffmann, Berthold, Minas, Mark
core +3 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
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
Syntactic parser combination for improved dependency analysis [PDF]
Proceedings of the 3rd Workshop on RObust Methods in Analysis of Natural Language Data - ROMAND '04, 2004 The goal of this article is to present our work about a combination of several syntactic parsers to produce a more robust parser. We have built a platform which allows us to compare syntactic parsers for a given language by splitting their results in elementary pieces, normalizing them, and comparing them with reference results.
openaire +1 more source
Multi-dimensional Type Theory: Rules, Categories, and Combinators for Syntax and Semantics
, 2004 We investigate the possibility of modelling the syntax and semantics of natural language by constraints, or rules, imposed by the multi-dimensional type theory Nabla.
Villadsen, Jørgen
core +2 more sources
, 2012 This paper presents an ensemble system for dependency parsing: three parsers are separately trained and combined by means of a majority vote. The three parsers are (1) the MATE parser [http://code.google.com/p/mate-tools/], (2) the DeSR parser [http://sites.google.com/site/desrparser/], and (3) the MALT parser [http://maltparser.org/].
MAZZEI, Alessandro, BOSCO, CRISTINA
openaire +1 more source
Modeling and Testing Implementations of Protocols with Complex Messages [PDF]
, 2018 This paper presents a new language called APSL for formally describing protocols to facilitate automated testing. Many real world communication protocols exchange messages whose structures are not trivial, e.g.
Prasetya, I. S. W. B., Tervoort, Tom
core +1 more source
Opportunities for a Truffle-based Golo Interpreter [PDF]
, 2015 Golo is a simple dynamically-typed language for the Java Virtual Machine. Initially implemented as a ahead-of-time compiler to JVM bytecode, it leverages invokedy-namic and JSR 292 method handles to implement a reasonably efficient runtime.
Loiseau, Yannick +3 more
core +2 more sources
, 2002 We present memory-based learning approaches to shallow parsing and apply these to five tasks: base noun phrase identification, arbitrary base phrase recognition, clause detection, noun phrase parsing and full parsing.
Sang, Erik F. Tjong Kim
core +1 more source
Parsing of Hyperedge Replacement Grammars with Graph Parser Combinators
, 2008 Steffen Mazanek, Mark Minas
openalex +1 more source