Sciweavers

27119 search results - page 4983 / 5424
» Languages
Sort
View
ENTCS
2007
101views more  ENTCS 2007»
15 years 6 months ago
Semantic Determinism and Functional Logic Program Properties
In modern functional logic languages like Curry or Toy, programs are possibly non-confluent and nonterminating rewrite systems, defining possibly non-deterministic non-strict fu...
José Miguel Cleva, Francisco Javier L&oacut...
ENTCS
2007
95views more  ENTCS 2007»
15 years 6 months ago
Hybridizing a Logical Framework
Logical connectives familiar from the study of hybrid logic can be added to the logical framework LF, a constructive type theory of dependent functions. This extension turns out t...
Jason Reed
JOT
2006
113views more  JOT 2006»
15 years 6 months ago
Constraint Validation in Model Compilers
Model transformation has become one of the most focused research field, motivated by for instance the OMG's Model-Driven Architecture (MDA). Metamodeling is a central techniq...
László Lengyel, Tihamer Levendovszky...
ENTCS
2007
105views more  ENTCS 2007»
15 years 6 months ago
Narrowing and Rewriting Logic: from Foundations to Applications
Narrowing was originally introduced to solve equational E-unification problems. It has also been recognized as a key mechanism to unify functional and logic programming. In both ...
Santiago Escobar, José Meseguer, Prasanna T...
ENTCS
2007
114views more  ENTCS 2007»
15 years 6 months ago
Reporting Failures in Functional Logic Programs
Computing with failures is a typical programming technique in functional logic programs. However, there are also situations where a program should not fail (e.g., in a determinist...
Michael Hanus
« Prev « First page 4983 / 5424 Last » Next »