Sciweavers

5415 search results - page 200 / 1083
» The Implementation of Functional Programming Languages
Sort
View
POPL
2006
ACM
16 years 1 months ago
Engineering with logic: HOL specification and symbolic-evaluation testing for TCP implementations
The TCP/IP protocols and Sockets API underlie much of modern computation, but their semantics have historically been very complex and ill-defined. The real standard is the de fact...
Steve Bishop, Matthew Fairbairn, Michael Norrish, ...
ICFP
2005
ACM
16 years 1 months ago
Scrap your boilerplate with class: extensible generic functions
The `Scrap your boilerplate' approach to generic programming allows the programmer to write generic functions that can traverse arbitrary data structures, and yet have type-s...
Ralf Lämmel, Simon L. Peyton Jones
FLOPS
2008
Springer
15 years 2 months ago
Rewriting and Call-Time Choice: The HO Case
It is known that the behavior of non-deterministic functions with call-time choice semantics, present in current functional logic languages, is not well described by usual approach...
Francisco Javier López-Fraguas, Juan Rodr&i...
CPHYSICS
2006
119views more  CPHYSICS 2006»
15 years 1 months ago
GDF: A tool for function estimation through grammatical evolution
This article introduces a tool for data fitting that is based on genetic programming and especially on the grammatical evolution technique. The user needs to input a series of poi...
Ioannis G. Tsoulos, Dimitris Gavrilis, Evangelos D...
JLP
2007
89views more  JLP 2007»
15 years 1 months ago
Universality and semicomputability for nondeterministic programming languages over abstract algebras
tract Algebras Wei Jiang∗ , Yuan Wang† , and Jeffery Zucker‡ September 11, 2006 The Universal Function Theorem (UFT) originated in 1930s with the work of Alan Turing, who p...
Wei Jiang, Yuan Wang, Jeffery I. Zucker