Return Styles: Pseud0ch, Terminal, Valhalla, NES, Geocities, Blue Moon.

Pages: 1-

scheme style

Name: Anonymous 2009-06-29 20:00

(define (func x) ...) or (define func (lambda (x) ...)?

Name: Anonymous 2009-06-29 20:15

>(pro-lambda-form? >>2)
#t

Name: λ 2009-06-29 20:19

λλλλλλλλλλλλλλλλλλλλλλλλλλλλλλλλλλλλλλλλλλλλλλλλλλλλλλλλλ

Name: Anonymous 2009-06-29 20:38

>>3
That reminds me, today I've learned how to do digraphs in vim! Now I can write Haskell with real lambda symbols just by doing ^K l *! :)

Name: Anonymous 2009-06-29 20:40

>>4
You really annoy me.

Name: ( λ‿λ) 2009-06-29 20:48

( λ‿λ)

Name: Anonymous 2009-06-29 22:00

( λ‿λ)

(λ‿λ )

( λ‿λ )

Name: Anonymous 2009-06-29 22:32

>>1
Lambda notation is supposed to be used for anonymous functions only. Using explicit lambdas for named functions is just some sort of functional-programming masturbation.

Name: Anonymous 2009-06-29 22:34

>>8
Java programmer detected.

Name: Anonymous 2009-06-29 22:34

>>8
Lambda notation is supposed to be used for anonymous functions only
Agreed.
Using explicit lambdas for named functions is just some sort of functional-programming masturbation.
:(

Name: Anonymous 2009-06-29 23:07

perl style

sub func { my ($x) = @_; ... } or BEGIN { *func = sub { my ($x) = @_; ... } }?

Name: Anonymous 2009-06-29 23:12

>>8
functional-programming masturbation
That's Scheme for you.

Name: Anonymous 2009-06-30 0:07

>>1

(define (func x) (lambda (y) (lambda (z) ...)))
; instead of
(define (func x y z) ...)))

since I'm so used to curried functions.

Name: Anonymous 2009-06-30 0:12

>>13
Do you mean curried functions, or are you referring to the potential for partial application? If the latter, automate that before I slap you.

Name: Anonymous 2009-06-30 0:17

>>12
LISP is not functional.

Name: Anonymous 2009-06-30 8:50

(define foo (lambda (bar) ...)) is the style used in The Scheme Programming Language by Dybvig.

Name: FrozenVoid 2009-06-30 9:28

#define schemefunction(a,b,c)


__________________________________________
http://xs135.xs.to/xs135/09042/av922.jpg
orbis terrarum delenda est

Name: Anonymous 2009-06-30 10:01

>>11
I'd use INIT { ... } instead of BEGIN { ... } because it's closer to run-time declaration.

Name: Anonymous 2009-06-30 10:05

>>18
They are fucking aliased.

Name: Anonymous 2009-06-30 10:13

>>18
Enjoy you're forced parenthesization of calls.

Name: Anonymous 2009-06-30 10:44

>>5
What did I do :(

Name: Anonymous 2009-06-30 11:44

>>21
How do you do that sad face?

Name: Anonymous 2009-06-30 11:46

>>22
[smilie type="sad"/]

Name: Anonymous 2009-06-30 12:49

>>4
For maximum win, it should emulate DrScheme's Ctrl+\. Thank you for your cooperation.

Name: Anonymous 2009-06-30 15:50

:(

Name: Anonymous 2009-06-30 22:48

>>15
And Scheme is similar to Lisp, except it's only good for FP wanking.

Name: Anonymous 2009-06-30 22:52

>>25
(ノ◔ ◡ ◔)ノ

Name: Anonymous 2010-12-06 9:04

Back to /b/, ``GNAA Faggot''

Name: Anonymous 2013-08-31 7:56


It can be proved that the cardinality of the real numbers is greater than that of the natural numbers just described. This can be visualized using Cantor's diagonal argument; classic questions of cardinality (for instance the continuum hypothesis) are concerned with discovering whether there is some cardinal between some pair of other infinite cardinals. In more recent times mathematicians have been describing the properties of larger and larger cardinals.

Name: Anonymous 2013-08-31 8:41


The Indian mathematical text Surya Prajnapti (c. 3rd–4th century BCE) classifies all numbers into three sets: enumerable, innumerable, and infinite. Each of these was further subdivided into three orders:

Name: Anonymous 2013-08-31 9:26


The IEEE floating-point standard (IEEE 754) specifies the positive and negative infinity values. These are defined as the result of arithmetic overflow, division by zero, and other exceptional operations.

Name: Anonymous 2013-08-31 10:12


For example, properties of the natural and real numbers can be derived within set theory, as each number system can be identified with a set of equivalence classes under a suitable equivalence relation whose field is some infinite set.

Name: Anonymous 2013-08-31 10:58


Although originally controversial, the axiom of choice is now used without reservation by most mathematicians, and it is included in Zermelo–Fraenkel set theory with the axiom of choice (ZFC), the standard form of axiomatic set theory.

Don't change these.
Name: Email:
Entire Thread Thread List