edited by
577 views
1 votes
1 votes

Match the following with reference to Functional programming history :

$\begin{array}{clcl}  \text{a.} & \text{Lambda calculus} & \text{i.} & \text{Church, 1932} \\ \text{b.} & \text{Lambda calculus as} & \text{ii.} & \text{Wordsworth, 1970} \\  & \text{programming language} \\ \text{c.} & \text{Lazy evaluation} & \text{iii.} & \text{Haskel, 1990} \\  \text{d.} & \text{Type classes} & \text{iv.} & \text{Mecarthy, 1960} \\  \end{array}$

$\textbf{Codes :}$

  1. $\text{a-iv, b-i, c-iii, d-ii}$
  2. $\text{a-i, b-iv, c-ii, d-iii}$
  3. $\text{a-iii, b-ii, c-iv, d-i}$
  4. $\text{a-ii, b-i, c-iv, d-iii}$
edited by

1 Answer

Related questions

3 votes
3 votes
1 answer
1
makhdoom ghaya asked Sep 30, 2016
1,706 views
Aliasing in the context of programming languages refers to :Multiple variables having the same locationMultiple variables having the same identifierMultiple variables hav...
1 votes
1 votes
3 answers
2
makhdoom ghaya asked Oct 4, 2016
4,090 views
Which formal system provides the semantic foundation for Prolog ?Predicate calculusLambda calculusHoare logicPropositional logic
1 votes
1 votes
1 answer
4