mathematics

Kent Recursive Calculator

Kent Recursive Calculator is a mathematics topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand Kent Recursive Calculator rather than just read about it. In short: KRC (Kent Recursive Calculator) is a lazy functional language developed by David Turner from November 1979 to October 1981 based on SASL, with pattern matching, guards and ZF expressions (now more usually called list comprehensions). Two implementations of KRC were written: David Turner's original one in BCPL running on EMAS, and Simon J.

Key takeaways

Kent Recursive Calculator belongs to mathematics; place it in that map before memorising details.
Learn the definition first, then one example that makes the definition concrete.
Connect Kent Recursive Calculator to a quantity you can measure, compute or draw — that is where exam questions come from.
Reproduce the core statement of Kent Recursive Calculator from memory before moving on to harder problems.

Reference excerpt

KRC (Kent Recursive Calculator) is a lazy functional language developed by David Turner from November 1979 to October 1981 based on SASL, with pattern matching, guards and ZF expressions (now more usually called list comprehensions). Two implementations of KRC were written: David Turner's original one in BCPL running on EMAS, and Simon J. Croft's later one in C under Unix, and KRC was the main language used for teaching functional programming at the University of Kent at Canterbury (UK) from 1982 to 1985. The direct successor to KRC is Miranda, which includes a polymorphic type discipline based on that of Milner's ML.

References

Further reading Functional Programming and its Applications, David A. Turner, Cambridge U Press 1982. Turner, D.A. (1981). "The semantic elegance of Applicative Languages". Proceedings of the 1981 Conference on Functional Programming Languages and Computer Architecture. Association for Computing Machinery. pp. 85–92. ISBN 0-89791-060-5.

External links KRC's home page Its open source interpreter for Unix, based on Professor Turner's 1982 version for EMAS

Worked examples

Example 1 — a first encounter with Kent Recursive Calculator

Start with the simplest possible case. Write down what Kent Recursive Calculator claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In mathematics, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Kent Recursive Calculator before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Kent Recursive Calculator ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Kent Recursive Calculator

In research: Kent Recursive Calculator appears in mathematics research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry: Engineering practice reuses Kent Recursive Calculator in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom: Kent Recursive Calculator is common in secondary-school and first-year university syllabi. It links to neighbouring topics Functional languages, History of computing in the United Kingdom, Programming language topic stubs, so understanding it makes those chapters shorter.
In everyday life: Look for Kent Recursive Calculator outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study Kent Recursive Calculator in 20 minutes

Read the reference excerpt below once, without taking notes.
Close the page and write down what Kent Recursive Calculator means in your own words.
Compare your version with the excerpt and mark what you missed.
Work through the three examples above with pen and paper.
Explain Kent Recursive Calculator out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Kent Recursive Calculator in simple terms?

Why does Kent Recursive Calculator matter?

Because it connects several mathematics ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Kent Recursive Calculator?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Kent Recursive Calculator.