NummSquared 2006a0 Explained

Set theory is the standard foundation for mathematics, butoften lacks rules of reduction for function calls. Thus, forcomputer science, the untyped lambda calculus or type theory isusually preferred. The untyped lambda calculus and severalimprovements make functions fundamental, but suffer fromnon-terminating reductions and have partially non-classical logics.Type theory is a good foundation for logic, math and computerscience, yet with both types and functions fundamental, it is morecomplex than set theory or the untyped lambda calculus.NummSquared, a new foundational language, makes only functionsfundamental, yet ensures terminating reductions, has a classicallogic, and attempts to follow set theory as much as possible.NummSquared builds on John von Neumann's 1925 work and R. B.Jones's 1998 work. NummSquared is well-founded, has reduction andproof, and supports computation and reflection. Because ofcoercion, there are no types, and functions are defined and calledwithout proof, yet reduction terminates. An interpreter, NsGo (inprogress when Samuel Howse died), is an F/C .NET assembly, mostlyautomatically extracted from a program of the Coq proofassistant.

Klappentext
Set theory is the standard foundation for mathematics, but often lacks rules of reduction for function calls. Thus, for computer science, the untyped lambda calculus or type theory is usually preferred. The untyped lambda calculus and several improvements make functions fundamental, but suffer from non-terminating reductions and have partially non-classical logics. Type theory is a good foundation for logic, math and computer science, yet with both types and functions fundamental, it is more complex than set theory or the untyped lambda calculus. NummSquared, a new foundational language, makes only functions fundamental, yet ensures terminating reductions, has a classical logic, and attempts to follow set theory as much as possible. NummSquared builds on John von Neumann's 1925 work and R. B. Jones's 1998 work. NummSquared is well-founded, has reduction and proof, and supports computation and reflection. Because of coercion, there are no types, and functions are defined and called without proof, yet reduction terminates. An interpreter, NsGo (in progress when Samuel Howse died), is an F#/C# .NET assembly, mostly automatically extracted from a program of the Coq proof assistant.