Sciweavers

10055 search results - page 332 / 2011
» Structured programming using processes
Sort
View
81
Voted
ISMIR
2001
Springer
117views Music» more  ISMIR 2001»
15 years 5 months ago
Score Processing For MIR
The focus of this paper is on the design and use of a music score representation. The structure of the representation is discussed and illustrated with sample algorithms, includin...
Donncha Ó. Maidín
COLING
1996
15 years 2 months ago
Processing Metonymy- a Domain-Model Heuristic Graph Traversal Approach
We address here the treatment of metonymic expressions from a knowledge representation perspective, that is, in the context of a text understanding system which aims to build a co...
Jacques Bouaud, Bruno Bachimont, Pierre Zweigenbau...
ENTCS
2002
125views more  ENTCS 2002»
15 years 14 days ago
Specification of Logic Programming Languages from Reusable Semantic Building Blocks
We present a Language Prototyping System that facilitates the modular development of interpreters from independent semantic buildks. The abstract syntax is modelled as the fixpoint...
José Emilio Labra Gayo, Juan Manuel Cueva L...
104
Voted
TPHOL
2002
IEEE
15 years 5 months ago
Weakest Precondition for General Recursive Programs Formalized in Coq
Abstract. This paper describes a formalization of the weakest precondition, wp, for general recursive programs using the type-theoretical proof assistant Coq. The formalization is ...
Xingyuan Zhang, Malcolm Munro, Mark Harman, Lin Hu
IFL
2007
Springer
128views Formal Methods» more  IFL 2007»
15 years 6 months ago
The Structure of the Essential Haskell Compiler, or Coping with Compiler Complexity
In this paper we describe the structure of the Essential Haskell Compiler (EHC) and how we manage its complexity, despite its growth from essentials to a full Haskell compiler. Our...
Atze Dijkstra, Jeroen Fokker, S. Doaitse Swierstra