Look Ma, Backtracking without Recursion

OLYMPIADS IN INFORMATICS ◽

10.15388/ioi.2021.10 ◽

2021 ◽

pp. 119-132

Author(s):

Tom VERHOEFF

Keyword(s):

Recursive Function ◽

Lambda Calculus ◽

Object Oriented

I show how backtracking can be discovered naturally without using a recursive function (nor using a loop with an explicit stack). Rather, my approach involves a form of self application that can be elegantly expressed in an object-oriented program, and that is reminiscent of how recursion is done in lambda calculus. It also illustrates why reasoning about object-oriented programs can be hard.

Download Full-text

Operations on records

Mathematical Structures in Computer Science ◽

10.1017/s0960129500000049 ◽

1991 ◽

Vol 1 (1) ◽

pp. 3-48 ◽

Cited By ~ 47

Author(s):

Luca Cardelli ◽

John C. Mitchell

Keyword(s):

Type System ◽

Lambda Calculus ◽

Object Oriented ◽

Order Type ◽

Second Order ◽

Typed Lambda Calculus ◽

Semantic Models ◽

Object Oriented Languages

We define a simple collection of operations for creating and manipulating record structures, where records are intended as finite associations of values to labels. A second-order type system over these operations supports both subtyping and polymorphism. We provide typechecking algorithms and limited semantic models.Our approach unifies and extends previous notions of records, bounded quantification, record extension, and parametrization by row-variables. The general aim is to provide foundations for concepts found in object-oriented languages, within a framework based on typed lambda-calculus.

Download Full-text

The Synthesis of Decoupling Courseware from Object-Oriented Anguages in Byzantine Fault Tolerance

International Journal of Innovative Technology and Exploring Engineering - Special Issue ◽

10.35940/ijitee.i3208.0789s319 ◽

2019 ◽

Vol 8 (9S3) ◽

pp. 979-981

Keyword(s):

Model Checking ◽

Present Status ◽

Associate Degree ◽

World Wide ◽

Lambda Calculus ◽

Object Oriented ◽

Voice Over Ip ◽

Byzantine Fault Tolerance ◽

The World ◽

New Framework

The ramifications of trainable epistemologies have been expansive and unavoidable. Given the present status of independent symmetries, physicists shockingly want the investigation of model checking, which encapsulates the broad standards of shared systems administration. Here, we utilize ambimorphic epistemologies to affirm that the World Wide Web and clog control are for the most part contrary.The Surrender customers agree that classical construct are associate degree exciting new hassle swear inner the problem of e-voting era, and cyberneticists concur. during this paintings, we tend to show the exploration of voice-over-IP, that embodies the necessary wants of construct. MuticAllyl, our new framework for lambda calculus, is that the resolution to any or all of those issues.

Download Full-text

Instance-Level Modeling and Simulation Using Lambda-Calculus and Object-Oriented Environments

Lecture Notes in Business Information Processing - Enterprise and Organizational Modeling and Simulation ◽

10.1007/978-3-642-24175-8_11 ◽

2011 ◽

pp. 145-158 ◽

Cited By ~ 4

Author(s):

Vojtěch Merunka

Keyword(s):

Modeling And Simulation ◽

Lambda Calculus ◽

Object Oriented

Download Full-text

Theoretical Pearls:Representing ‘undefined’ in lambda calculus

Journal of Functional Programming ◽

10.1017/s0956796800000447 ◽

1992 ◽

Vol 2 (3) ◽

pp. 367-374 ◽

Cited By ~ 13

Author(s):

Henk Barendregt

Keyword(s):

Normal Form ◽

Recursive Function ◽

Lambda Calculus ◽

Recursion Theory ◽

Partial Recursive Function ◽

Normalization Theorem ◽

Image Position

AbstractLet ψ be a partial recursive function (of one argument) with λ-defining termF∈Λ°. This meansThere are several proposals for whatF⌜n⌝ should be in case ψ(n) is undefined: (1) a term without a normal form (Church); (2) an unsolvable term (Barendregt); (3) an easy term (Visser); (4) a term of order 0 (Statman).These four possibilities will be covered by one ‘master’ result of Statman which is based on the ‘Anti Diagonal Normalization Theorem’ of Visser (1980). That ingenious theorem about precomplete numerations of Ershov is a powerful tool with applications in recursion theory, metamathematics of arithmetic and lambda calculus.

Download Full-text