Skip to main content

Type-Theory of Parametric Algorithms with Restricted Computations

  • Conference paper
  • First Online:

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 1237))

Abstract

The paper extends the formal language and reduction calculus of Moschovakis type-theory of recursion, by adding a restrictor operator on terms with predicative constraints. Terms with restrictions over memory variables formalise inductive algorithms with generalised, restricted parameters. The theory provides restricted computations for algorithmic semantics of mathematical expressions and definite descriptors, in formal and natural languages.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   149.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   199.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Loukanova, R.: Gamma-reduction in type theory of acyclic recursion. Fundam. Inform. 170(4), 367–411 (2019). https://doi.org/10.3233/FI-2019-1867

  2. Loukanova, R.: Gamma-star canonical forms in the type-theory of acyclic algorithms. In: van den Herik, J., Rocha, A.P. (eds.) Agents and Artificial Intelligence. ICAART 2018. Lecture Notes in Computer Science, vol. 11352, pp. 383–407. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-05453-3_18

  3. Loukanova, R.: Type-theory of acyclic algorithms for models of consecutive binding of functional neuro-receptors. In: Grabowski, A., Loukanova, R., Schwarzweller, C. (eds.) AI Aspects in Reasoning, Languages, and Computation, vol. 889, pp. 1–48. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-41425-2_1

  4. Moschovakis, Y.N.: Sense and denotation as algorithm and value. In: Oikkonen, J., Väänänen, J. (eds.) Logic Colloquium ’90: ASL Summer Meeting in Helsinki. Lecture Notes in Logic, vol. 2, pp. 210–249. Springer, Berlin (1993)

    Google Scholar 

  5. Moschovakis, Y.N.: A logical calculus of meaning and synonymy. Linguist. Philos. 29(1), 27–89 (2006). https://doi.org/10.1007/s10988-005-6920-7

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Roussanka Loukanova .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Loukanova, R. (2021). Type-Theory of Parametric Algorithms with Restricted Computations. In: Dong, Y., Herrera-Viedma, E., Matsui, K., Omatsu, S., González Briones, A., Rodríguez González, S. (eds) Distributed Computing and Artificial Intelligence, 17th International Conference. DCAI 2020. Advances in Intelligent Systems and Computing, vol 1237. Springer, Cham. https://doi.org/10.1007/978-3-030-53036-5_35

Download citation

Publish with us

Policies and ethics