Sciweavers

3323 search results - page 115 / 665
» Computational Semantics with Functional Programming
Sort
View
ASM
2003
ASM
15 years 3 months ago
Remarks on Turbo ASMs for Functional Equations and Recursion Schemes
The question raised in [15] is answered how to naturally dely used forms of recursion by abstract machines. We show that turbo ASMs as defined in [7] allow one to faithfully refl...
Egon Börger, Tommaso Bolognesi
POPL
2005
ACM
15 years 10 months ago
A probabilistic language based upon sampling functions
As probabilistic computations play an increasing role in solving various problems, researchers have designed probabilistic languages that treat probability distributions as primit...
Sungwoo Park, Frank Pfenning, Sebastian Thrun
ECSQARU
2009
Springer
15 years 4 months ago
Merging Belief Bases Represented by Logic Programs
Abstract. This paper presents a method which allows for merging beliefs expressed thanks to logic programming with stable model semantics. This method is based on the syntactic mer...
Julien Hué, Odile Papini, Eric Würbel
SPIN
2009
Springer
15 years 4 months ago
Symbolic Analysis via Semantic Reinterpretation
Abstract. The paper presents a novel technique to create implementations of the basic primitives used in symbolic program analysis: forward symbolic evaluation, weakest liberal pre...
Junghee Lim, Akash Lal, Thomas W. Reps
SERP
2007
14 years 11 months ago
Developing an Online Function Reader
A function reader is a program that can read an input function and evaluate the function for a given input value at run time. Any Computer Algebra System and Graphing Calculator ar...
Mingshen Wu, Weihu Hong