Sciweavers

8766 search results - page 433 / 1754
» Functional logic programming
Sort
View
FLOPS
1999
Springer
15 years 8 months ago
Using Types as Approximations for Type Checking Prolog Programs
Abstract. Subtyping tends to undermine the effects of parametric polymorphism as far as the static detection of type errors is concerned. Starting with this observation we present...
Christoph Beierle, Gregor Meyer
ACL
1990
15 years 5 months ago
Multiple Underlying Systems: Translating User Requests into Programs to Produce Answers
A user may typically need to combine the strengths of more than one system in order to perform a task. In this paper, we describe a component of the Janus natural language interfa...
Robert J. Bobrow, Philip Resnik, Ralph M. Weisched...
CADE
2010
Springer
15 years 4 months ago
Automated Synthesis of Induction Axioms for Programs with Second-Order Recursion
In order to support the verification of programs, verification tools such as ACL2 or Isabelle try to extract suitable induction axioms from the definitions of terminating, recursiv...
Markus Aderhold
EUSFLAT
2009
114views Fuzzy Logic» more  EUSFLAT 2009»
15 years 1 months ago
The Use of Interval-Valued Probability Measures in Fuzzy Linear Programming: a constraint set approach
This paper uses a constraint set approach to linear programming problems with equality constraints whose coefficients and/or right-hand side values could be uncertain. We consider ...
Phantipa Thipwiwatpotjana, Weldon A. Lodwick
99
Voted
CORR
2010
Springer
108views Education» more  CORR 2010»
15 years 1 months ago
Recursive Definitions of Monadic Functions
Using standard domain-theoretic fixed-points, we present an approach for defining recursive functions that are formulated in monadic style. The method works both in the simple opt...
Alexander Krauss