On the public citation graph
Computable functionals of finite types
0 signed · 80 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf02219730openalex-snapshot
Computable numerations of morphisms
inferredcites →https://doi.org/10.1016/s0049-237x(08)71230-8openalex-snapshot
Some Reasons for Generalizing Recursion Theory
inferredcites →https://doi.org/10.2307/2270617openalex-snapshot
On the indexing of classes of recursively enumerable sets
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/malq.200310126openalex-snapshot
Hierarchies inφ‐spaces and applications
inferred← citeshttps://doi.org/10.1007/3-540-07854-1_168openalex-snapshot
Recursive program schemes and computable functionals
inferred← citeshttps://doi.org/10.1007/3-540-07854-1_223openalex-snapshot
Degrees of parallelism in computations
inferred← citeshttps://doi.org/10.1007/3-540-12920-0_17openalex-snapshot
Computability in higher types and the universal domain Pω
inferred← citeshttps://doi.org/10.1007/3-540-44802-0_12openalex-snapshot
Semantic Characterisations of Second-Order Computability over the Real Numbers
inferred← citeshttps://doi.org/10.1007/3-540-45335-0_10openalex-snapshot
Formalisation of Computability of Operators and Real-Valued Functionals via Domain Theory
inferred← citeshttps://doi.org/10.1007/978-1-4612-2822-6_3openalex-snapshot
Computability and Complexity of Higher Type Functions
inferred← citeshttps://doi.org/10.1007/978-3-030-37487-7_15openalex-snapshot
Computable Topology for Reliable Computations
inferred← citeshttps://doi.org/10.1007/978-3-319-40189-8_31openalex-snapshot
On the Lattices of Effectively Open Sets
inferred← citeshttps://doi.org/10.1007/978-3-319-63334-3_2openalex-snapshot
Feferman on Computability
inferred← citeshttps://doi.org/10.1007/978-3-540-78127-1_34openalex-snapshot
On Natural Non-dcpo Domains
inferred← citeshttps://doi.org/10.1007/bf00967869openalex-snapshot
Functionals computable in series and in parallel
inferred← citeshttps://doi.org/10.1007/bf01069523openalex-snapshot
Composition aspects of programmology. II
inferred← citeshttps://doi.org/10.1007/bf01084073openalex-snapshot
Relationship between sheaf spaces and numbered sets with the C 2 * property
inferred← citeshttps://doi.org/10.1007/bf01084090openalex-snapshot
Constructive operators of finite types
inferred← citeshttps://doi.org/10.1007/bf01101651openalex-snapshot
Semantics of algorithmic languages
inferred← citeshttps://doi.org/10.1007/bf01463138openalex-snapshot
Maximal and everywhere-defined functionals
inferred← citeshttps://doi.org/10.1007/bf01669439openalex-snapshot
Partial enumerable and finite functionals
inferred← citeshttps://doi.org/10.1007/bf01876321openalex-snapshot
Expressibility of functions in D. Scott's LCF language
inferred← citeshttps://doi.org/10.1007/bf02011868openalex-snapshot
Eine beweistheoretische Anwendung partieller stetiger Funktionale
inferred← citeshttps://doi.org/10.1007/bf02284592openalex-snapshot
Everywhere-defined continuous functionals
inferred← citeshttps://doi.org/10.1007/bfb0030292openalex-snapshot
Limits, higher type computability and type-free languages
inferred← citeshttps://doi.org/10.1007/bfb0099496openalex-snapshot
Effective operators in a topological setting
inferred← citeshttps://doi.org/10.1007/s001530200138openalex-snapshot
Continuity, proof systems and the theory of transfinite computations
inferred← citeshttps://doi.org/10.1007/s00500-024-09926-2openalex-snapshot
A categorical equivalence between L-continuous lattices and continuous generalized L-closure spaces
inferred← citeshttps://doi.org/10.1016/0168-0072(91)90065-topenalex-snapshot
Domain theory in logical form*
inferred← citeshttps://doi.org/10.1016/0168-0072(95)00067-4openalex-snapshot
Effective inseparability in a topological setting
inferred← citeshttps://doi.org/10.1016/0168-0072(96)88189-9openalex-snapshot
Computation on abstract data types. The extensional approach, with an application to streams
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90030-7openalex-snapshot
Computability in higher types, Pω and the completeness of type assignment
inferred← citeshttps://doi.org/10.1016/j.apal.2008.07.007openalex-snapshot
On the classification of (effective) φ -spaces
inferred← citeshttps://doi.org/10.1016/j.apal.2008.09.027openalex-snapshot
Natural non-dcpo domains and f-spaces
inferred← citeshttps://doi.org/10.1016/j.apal.2011.06.013openalex-snapshot
The extensional ordering of the sequential functionals
inferred← citeshttps://doi.org/10.1016/j.entcs.2014.01.007openalex-snapshot
Formal Contexts for Algebraic Domains
inferred← citeshttps://doi.org/10.1016/j.entcs.2017.08.002openalex-snapshot
Domain Theory its Ramifications and Interactions
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.03.026openalex-snapshot
Recursion and topology on 2⩽ω for possibly infinite computations
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.07.049openalex-snapshot
Two categories of effective continuous cpos
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.07.053openalex-snapshot
Towards a descriptive set theory for domain-like structures
inferred← citeshttps://doi.org/10.1016/s0019-9958(84)80009-1openalex-snapshot
Effectively given domains and lambda-calculus models
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70435-5openalex-snapshot
Inductive Schemata and Recursively Continuous Functionals
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70437-9openalex-snapshot
Computable and recursively countable functions of higher type
inferred← citeshttps://doi.org/10.1016/s0049-237x(99)80024-xopenalex-snapshot
The Continuous Functionals
inferred← citeshttps://doi.org/10.1016/s0049-237x(99)80032-9openalex-snapshot
Classifying Recursive Functions
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00319-4openalex-snapshot
Representations versus numberings: on the relationship of two computability notions
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00167-3openalex-snapshot
The bounded-complete hull of an α-space
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00097-8openalex-snapshot
A domain-theoretic approach to computability on the real line
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00288-6openalex-snapshot
Computable Banach spaces via domain theory
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80623-1openalex-snapshot
Continuous Domains and Banach Spaces
inferred← citeshttps://doi.org/10.1017/9781316755884.004openalex-snapshot
Notions of computability at higher types I
inferred← citeshttps://doi.org/10.1017/cbo9780511546464.015openalex-snapshot
On some problems in computable topology
inferred← citeshttps://doi.org/10.1017/cbo9781107338579.012openalex-snapshot
Higher generalizations of the Turing Model
inferred← citeshttps://doi.org/10.1017/s0960129507006251openalex-snapshot
On the ubiquity of certain total type structures
inferred← citeshttps://doi.org/10.1017/s0960129516000165openalex-snapshot
On naturally continuous non-dcpo domains
inferred← citeshttps://doi.org/10.1017/s0960129524000173openalex-snapshot
Countability constraints in order-theoretic approaches to computability
inferred← citeshttps://doi.org/10.1070/rm1990v045n01abeh002321openalex-snapshot
Can an individual sequence of zeros and ones be random?
inferred← citeshttps://doi.org/10.1070/rm2000v055n06abeh000354openalex-snapshot
Yuri Leonidovich Ershov (on his 60th birthday)
inferred← citeshttps://doi.org/10.1109/tfuzz.2015.2428720openalex-snapshot
A Categorical Isomorphism Between Injective Stratified Fuzzy $T_{\bm 0}$ Spaces and Fuzzy Continuous Lattices
inferred← citeshttps://doi.org/10.1134/s0037446626010180openalex-snapshot
Properties of Function Spaces
inferred← citeshttps://doi.org/10.1145/304012.304040openalex-snapshot
Foundation of a computable solid modeling
inferred← citeshttps://doi.org/10.2168/lmcs-3(3:7)2007openalex-snapshot
Inductive Definition and Domain Theoretic Properties of Fully Abstract
inferred← citeshttps://doi.org/10.2178/bsl/1058448675openalex-snapshot
Computable and Continuous Partial Homomorphisms on Metric Partial Algebras
inferred← citeshttps://doi.org/10.2178/bsl/1140640943openalex-snapshot
Computing with Functionals—Computability Theory or Computer Science?
inferred← citeshttps://doi.org/10.2178/jsl/1268917496openalex-snapshot
Effectivity and effective continuity of multifunctions
inferred← citeshttps://doi.org/10.22111/ijfs.2014.1622openalex-snapshot
A duality between fuzzy domains and strongly completely distributive $L$-ordered sets
inferred← citeshttps://doi.org/10.2307/2586691openalex-snapshot
Computability over the partial continuous functionals
inferred← citeshttps://doi.org/10.2307/421098openalex-snapshot
Domains for Computation in Mathematics, Physics and Exact Real Arithmetic
inferred← citeshttps://doi.org/10.2307/797968openalex-snapshot
Computation on Abstract Data Types. The Extensional Approach, with an Application to Streams
inferred← citeshttps://doi.org/10.3233/com-230463openalex-snapshot
How much partiality is needed for a theory of computability?
inferred← citeshttps://doi.org/10.32657/10356/73368openalex-snapshot
Reverse mathematics in lattice theory
inferred← citeshttps://doi.org/10.4230/lipics.itp.2019.31openalex-snapshot
Domain Theory and the Logic of Observable Properties
inferred← citeshttps://doi.org/10.4288/jafpos.25.0_57openalex-snapshot
Rudin's Lemma and Reverse Mathematics
inferred← citeshttps://doi.org/10.4995/agt.2000.13640openalex-snapshot
On domains witnessing increase in information
inferred← citeshttps://doi.org/10.5817/am2012-4-243openalex-snapshot
Partial dcpo’s and some applications
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.