Sciweavers

1636 search results - page 146 / 328
» Type-Theoretic Functional Semantics
Sort
View
TOCL
2002
110views more  TOCL 2002»
15 years 3 months ago
Abstract computability and algebraic specification
Computability and Algebraic Specification J. V. TUCKER University of Wales, Swansea and J. I. ZUCKER McMaster University Abstract computable functions are defined by abstract finit...
J. V. Tucker, Jeffery I. Zucker
SEMWEB
2007
Springer
15 years 10 months ago
Towards Fine-grained Service Matchmaking by Using Concept Similarity
Several description frameworks to semantically describe and match services on the one hand and service requests on the other have been presented in the literature. Many of the curr...
Alberto Fernández, Axel Polleres, Sascha Os...
123
Voted
ACSC
2005
IEEE
15 years 9 months ago
Optimising Parallel Pattern-matching by Source-level Program Transformation
Parallel pattern-matching (PPM) provides true commutative implementation of functions defined by cases in functional languages, because no argument is given precedence over any o...
R. Lyndon While, Tony Field
FLOPS
2004
Springer
15 years 9 months ago
Basic Pattern Matching Calculi: a Fresh View on Matching Failure
We propose pattern matching calculi as a refinement of λ-calculus that integrates mechanisms appropriate for fine-grained modelling of non-strict pattern matching. Compared with...
Wolfram Kahl
129
Voted
COLING
2008
15 years 5 months ago
Explaining Similarity of Terms
Computing the similarity between entities is a core component of many NLP tasks such as measuring the semantic similarity of terms for generating a distributional thesaurus. In th...
Vishnu Vyas, Patrick Pantel