| dbo:abstract
|
- In formal language theory and computer science, Iota and Jot (from Greek iota ι, Hebrew yodh י, the smallest letters in those two alphabets) are languages, extremely minimalist formal systems, designed to be even simpler than other more popular alternatives, such as the lambda calculus and SKI combinator calculus. Thus, they can also be considered minimalist computer programming languages, or Turing tarpits, esoteric programming languages designed to be as small as possible but still Turing-complete. Both systems use only two symbols and involve only two operations. Both were created by professor of linguistics Chris Barker in 2001. Zot (2002) is a successor to Iota that supports input and output. Note that this article uses Backus-Naur form to describe syntax. (en)
- Le langage Iota est un langage de programmation Turing-complet conçu par . Il possède seulement deux symboles. (fr)
- Iota i Jot – w teorii języka formalnego i w informatyce Iota i Jot (od greckiej litery jota ι, oraz od hebrajskiej litery jod י, najmniejszych liter w obu alfabetach) są językami programowania, będącymi niezwykle minimalistycznymi systemami formalnymi, zaprojektowanymi tak, aby były jeszcze prostsze niż inne, bardziej popularne alternatywy, takie, jak rachunek lambda i . W związku z tym można je również uznać za minimalistyczne komputerowe języki programowania lub czy też ezoteryczne języki programowania zaprojektowane tak, aby były jak najmniejsze, ale nadal spełniające kompletność Turinga. Oba systemy programistyczne używają tylko dwóch symboli i obejmują tylko dwie operacje. Oba też zostały stworzone przez profesora językoznawstwa, w 2001 roku. Zot (2002), to następca języka Iota, który obsługuje wejście i wyjście. (pl)
- Iota e sua sucessora Jot (do idioma grego iota, hebraico Yodh, as menores letras nesses dois alfabetos) são linguagens de programação esotéricas, Turing tarpits que são projetadas para ser tão pequenas quanto possível, mas ainda assim Turing completa. Cada uma usa dois símbolos e envolve duas operações, com uma simples semântica denotacional definida em termos do cálculo lambda. Zot é uma versão continuada de Iota, que inclui entrada e saída. O combinador universal de Iota é o termo lambda . Então, pode-se recuperar os combinadores base SKI usuais como segue: . (pt)
|
| dbo:designer
| |
| dbo:developer
| |
| dbo:latestReleaseVersion
| |
| dbo:license
| |
| dbo:wikiPageExternalLink
| |
| dbo:wikiPageID
| |
| dbo:wikiPageLength
|
- 6427 (xsd:nonNegativeInteger)
|
| dbo:wikiPageRevisionID
| |
| dbo:wikiPageWikiLink
| |
| dbp:designer
| |
| dbp:developer
| |
| dbp:discontinued
| |
| dbp:influenced
| |
| dbp:latestReleaseVersion
| |
| dbp:license
| |
| dbp:name
| |
| dbp:paradigms
| |
| dbp:platform
|
- Scheme interpreter, Web browser (en)
|
| dbp:programmingLanguage
| |
| dbp:wikiPageUsesTemplate
| |
| dcterms:subject
| |
| rdf:type
| |
| rdfs:comment
|
- Le langage Iota est un langage de programmation Turing-complet conçu par . Il possède seulement deux symboles. (fr)
- Iota e sua sucessora Jot (do idioma grego iota, hebraico Yodh, as menores letras nesses dois alfabetos) são linguagens de programação esotéricas, Turing tarpits que são projetadas para ser tão pequenas quanto possível, mas ainda assim Turing completa. Cada uma usa dois símbolos e envolve duas operações, com uma simples semântica denotacional definida em termos do cálculo lambda. Zot é uma versão continuada de Iota, que inclui entrada e saída. O combinador universal de Iota é o termo lambda . Então, pode-se recuperar os combinadores base SKI usuais como segue: . (pt)
- In formal language theory and computer science, Iota and Jot (from Greek iota ι, Hebrew yodh י, the smallest letters in those two alphabets) are languages, extremely minimalist formal systems, designed to be even simpler than other more popular alternatives, such as the lambda calculus and SKI combinator calculus. Thus, they can also be considered minimalist computer programming languages, or Turing tarpits, esoteric programming languages designed to be as small as possible but still Turing-complete. Both systems use only two symbols and involve only two operations. Both were created by professor of linguistics Chris Barker in 2001. Zot (2002) is a successor to Iota that supports input and output. (en)
- Iota i Jot – w teorii języka formalnego i w informatyce Iota i Jot (od greckiej litery jota ι, oraz od hebrajskiej litery jod י, najmniejszych liter w obu alfabetach) są językami programowania, będącymi niezwykle minimalistycznymi systemami formalnymi, zaprojektowanymi tak, aby były jeszcze prostsze niż inne, bardziej popularne alternatywy, takie, jak rachunek lambda i . W związku z tym można je również uznać za minimalistyczne komputerowe języki programowania lub czy też ezoteryczne języki programowania zaprojektowane tak, aby były jak najmniejsze, ale nadal spełniające kompletność Turinga. (pl)
|
| rdfs:label
|
- Iota (langage) (fr)
- Iota and Jot (en)
- Iota i Jot (pl)
- Iota e Jot (pt)
|
| owl:sameAs
| |
| prov:wasDerivedFrom
| |
| foaf:homepage
| |
| foaf:isPrimaryTopicOf
| |
| foaf:name
| |
| is dbo:wikiPageDisambiguates
of | |
| is dbo:wikiPageRedirects
of | |
| is dbo:wikiPageWikiLink
of | |
| is foaf:primaryTopic
of | |
