Computability

Results: 1315



#Item
31The CPS transform from Griffin. Let us first repeat what Herman already showed on the blackboard. The definition of the CPS transform in Griffin is: x = λk. kx λx. M = λk. k (λx. M ) M N = λk. M (λm. N (λn. mnk))

The CPS transform from Griffin. Let us first repeat what Herman already showed on the blackboard. The definition of the CPS transform in Griffin is: x = λk. kx λx. M = λk. k (λx. M ) M N = λk. M (λm. N (λn. mnk))

Add to Reading List

Source URL: www.cs.ru.nl

Language: English - Date: 2011-11-28 07:13:57
32EPJ Web of Conferences 113, DOI: epjconf021  C Owned by the authors, published by EDP Sciences, 2016 Higgs particles interacting via a scalar Dark Matter field

EPJ Web of Conferences 113, DOI: epjconf021  C Owned by the authors, published by EDP Sciences, 2016 Higgs particles interacting via a scalar Dark Matter field

Add to Reading List

Source URL: www.epj-conferences.org

Language: English
33On Induction Principles C. Verhoef Programming Research Group University of Amsterdam KruislaanSJ Amsterdam

On Induction Principles C. Verhoef Programming Research Group University of Amsterdam KruislaanSJ Amsterdam

Add to Reading List

Source URL: www.cs.vu.nl

Language: English - Date: 2005-08-09 06:28:59
34All-Termination(T )? Panagiotis Manolios and Aaron Turon Northeastern University {pete,turon}@ccs.neu.edu Abstract. We introduce the All-Termination(T ) problem: given a termination solver T and a collection of functions

All-Termination(T )? Panagiotis Manolios and Aaron Turon Northeastern University {pete,turon}@ccs.neu.edu Abstract. We introduce the All-Termination(T ) problem: given a termination solver T and a collection of functions

Add to Reading List

Source URL: www.mpi-sws.org

Language: English - Date: 2010-01-10 16:47:25
35The key to blame: Gradual typing meets cryptography Jeremy Siek Philip Wadler Indiana University, USA

The key to blame: Gradual typing meets cryptography Jeremy Siek Philip Wadler Indiana University, USA

Add to Reading List

Source URL: homepages.inf.ed.ac.uk

Language: English - Date: 2016-07-07 08:33:11
36Parametricity and Proving Free Theorems for Functional-Logic Languages Stefan Mehner ∗ Daniel Seidel†

Parametricity and Proving Free Theorems for Functional-Logic Languages Stefan Mehner ∗ Daniel Seidel†

Add to Reading List

Source URL: www.lix.polytechnique.fr

Language: English - Date: 2014-12-08 09:42:38
37c 2005 Cambridge University Press JFP 15 (6), Meta-Programming through Typeful

c 2005 Cambridge University Press JFP 15 (6), Meta-Programming through Typeful

Add to Reading List

Source URL: www.cs.bu.edu

Language: English - Date: 2005-06-23 21:20:00
38What can a philosopher and logician do for your enterprise? v. 3, A series of un-ordered top ten lists with brief, non-exhaustive annotations to answer the question above follows. Top ten skills concerning philosophy in

What can a philosopher and logician do for your enterprise? v. 3, A series of un-ordered top ten lists with brief, non-exhaustive annotations to answer the question above follows. Top ten skills concerning philosophy in

Add to Reading List

Source URL: philosopher-animal.com

Language: English - Date: 2006-11-11 18:49:37
39Is Bioinformatics Possible? Philosophical problems and opportunities Johan Nyström-Persson, Level Five Co., Ltd and Australia-China Centre for Wheat Improvement

Is Bioinformatics Possible? Philosophical problems and opportunities Johan Nyström-Persson, Level Five Co., Ltd and Australia-China Centre for Wheat Improvement

Add to Reading List

Source URL: www.monomorphic.org

Language: English - Date: 2016-02-21 03:39:18
40An Adequate, Denotational, Functional-Style Semantics for Typed FlatCurry

An Adequate, Denotational, Functional-Style Semantics for Typed FlatCurry

Add to Reading List

Source URL: www.janis-voigtlaender.eu

Language: English - Date: 2016-08-01 05:50:10