Sciweavers

199 search results - page 12 / 40
» Combining Strict and Soft Typing in Functional Programming
Sort
View
123
Voted
POPL
2012
ACM
13 years 8 months ago
Higher-order functional reactive programming in bounded space
Functional reactive programming (FRP) is an elegant and successful approach to programming reactive systems declaratively. The high levels of abstraction and expressivity that mak...
Neelakantan R. Krishnaswami, Nick Benton, Jan Hoff...
128
Voted
ICFP
2002
ACM
16 years 11 days ago
A demand-driven adaptive type analysis
Compilers for dynamically and statically typed languages ensure safe execution by verifying that all operations are performed on appropriate values. An operation as simple as car ...
Danny Dubé, Marc Feeley
91
Voted
GAMEON
2001
15 years 1 months ago
A New Computational Approach to the Game of Go
This paper investigates the application of neural network techniques to the creation of a program that can play the game of Go with some degree of success. The combination of soft...
Julian Churchill, Richard Cant, David Al-Dabass
94
Voted
KBSE
1997
IEEE
15 years 4 months ago
Moving Proofs-As-Programs into Practice
Proofs in the Nuprl system, an implementation of a constructive type theory, yield “correct-by-construction” programs. In this paper a new methodology is presented for extract...
James L. Caldwell
114
Voted
CRYPTO
2006
Springer
149views Cryptology» more  CRYPTO 2006»
15 years 4 months ago
On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation
In the setting of multiparty computation, a set of parties wish to jointly compute a function of their inputs, while preserving security in the case that some subset of them are co...
Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Ere...