SK implementation of some data types

MaRDI QIDQ2763593zbMATH OpenFDO

Authors S. Malkov, N. Mitić, G. Lazić, A. Gačević

Publication date 20 January 2002

zbMATH Keywords

combinatorsdata typeSK implementation

Mathematics Subject Classification ID

Theory of programming languages (68N15) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)

Review text

A way of the including primitive data types (numbers, lists, strings, \dots) into the environment of pure combinators is described. Some basic combinators and their reductions rules are mentioned. After that the following data types and corresponding operators are introduced: logical constants, list constants, natural numbers and other data types. Three different equality for the introduced data types are defined too. The authors believe that introducing these data types could increase the efficiency of SK reduction machine implementation.NEWLINENEWLINEFor the entire collection see [Zbl 0977.00022].

Recommendations

• Implementation of data types by algebraic methods
• scientific article; zbMATH DE number 1420789
• scientific article; zbMATH DE number 4074446
• scientific article; zbMATH DE number 30668
• A reduction rule for Peirce formula

Cited in

(1)

• scientific article; zbMATH DE number 3896276 (Why is no real title available?)

This page was built for publication: SK implementation of some data types

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2763593)