On the public citation graph
Domains for denotational semantics
0 signed · 669 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/978-1-4612-6228-2openalex-snapshot
The Denotational Description of Programming Languages
inferredcites →https://doi.org/10.1007/978-3-642-67678-9openalex-snapshot
A Compendium of Continuous Lattices
inferredcites →https://doi.org/10.1007/978-94-009-7798-3_22openalex-snapshot
Some Ordered Sets in Computer Science
inferredcites →https://doi.org/10.1007/bfb0022474openalex-snapshot
Petri nets, event structures and domains
inferredcites →https://doi.org/10.1016/0096-0551(83)90036-xopenalex-snapshot
Denotational semantics: The scott-strachey approach to programming language theory
inferredcites →https://doi.org/10.1016/0304-3975(81)90112-2openalex-snapshot
Petri nets, event structures and domains, part I
inferredcites →https://doi.org/10.1016/c2009-0-14341-6openalex-snapshot
The Lambda Calculus - Its Syntax and Semantics
inferredcites →https://doi.org/10.1016/s0304-3975(82)80002-9openalex-snapshot
Sequential algorithms on concrete data structures
inferredcites →https://doi.org/10.1109/mahc.1981.10006openalex-snapshot
Formal Languages: Origins and Directions
inferredcites →https://doi.org/10.1137/0205036openalex-snapshot
The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus
inferredcites →https://doi.org/10.1147/rd.32.0114openalex-snapshot
Finite Automata and Their Decision Problems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9781119193784.ch8openalex-snapshot
Big Data Complex Event Processing for Internet of Things Provenance: Benefits for Audit, Forensics, and Safety
inferred← citeshttps://doi.org/10.1002/int.4550040303openalex-snapshot
Using a frame-based language for information retrieval
inferred← citeshttps://doi.org/10.1002/malq.201600020openalex-snapshot
Normal forms, linearity, and prime algebraicity over nonflat domains
inferred← citeshttps://doi.org/10.1006/inco.1993.1070openalex-snapshot
Computing ML Equality Kinds Using Abstract Interpretation
inferred← citeshttps://doi.org/10.1006/inco.1994.1003openalex-snapshot
Lambda-Calculi for (Strict) Parallel Functions
inferred← citeshttps://doi.org/10.1006/inco.1994.1052openalex-snapshot
A Fully Abstract Denotational Model for Higher-Order Processes
inferred← citeshttps://doi.org/10.1006/inco.1995.1086openalex-snapshot
Intersection and Union Types: Syntax and Semantics
inferred← citeshttps://doi.org/10.1006/inco.1998.2738openalex-snapshot
A Fully Abstract Semantics for Concurrent Constraint Programming
inferred← citeshttps://doi.org/10.1006/inco.1998.2773openalex-snapshot
Discrimination by Parallel Observers: The Algorithm
inferred← citeshttps://doi.org/10.1006/inco.1999.2827openalex-snapshot
Toward an Infinitary Logic of Domains: Abramsky Logic for Transition Systems
inferred← citeshttps://doi.org/10.1006/inco.1999.2828openalex-snapshot
Relational Interpretations of Recursive Types in an Operational Setting
inferred← citeshttps://doi.org/10.1006/inco.1999.2879openalex-snapshot
A Timed Concurrent Constraint Language
inferred← citeshttps://doi.org/10.1006/inco.2001.3073openalex-snapshot
Clausal Logic and Logic Programming in Algebraic Domains
inferred← citeshttps://doi.org/10.1007/10704567_9openalex-snapshot
Functional Plus Logic Programming with Built-In and Symbolic Constraints
inferred← citeshttps://doi.org/10.1007/10705424_1openalex-snapshot
Semantics and Types in Functional Logic Programming
inferred← citeshttps://doi.org/10.1007/10705424_23openalex-snapshot
A Semantics for Program Analysis in Narrowing-Based Functional Logic Languages
inferred← citeshttps://doi.org/10.1007/11874850_62openalex-snapshot
The Predicate-Minimizing Logic MIN
inferred← citeshttps://doi.org/10.1007/11921240_6openalex-snapshot
A Topological Approach of the Web Classification
inferred← citeshttps://doi.org/10.1007/3-540-12689-9_131openalex-snapshot
A note on powerdomains and modality
inferred← citeshttps://doi.org/10.1007/3-540-12896-4_372openalex-snapshot
Information systems, continuity and realizability
inferred← citeshttps://doi.org/10.1007/3-540-12896-4_382openalex-snapshot
From denotational to operational and axiomatic semantics for ALGOL-like languages: An overview
inferred← citeshttps://doi.org/10.1007/3-540-13346-1_14openalex-snapshot
F-semantics for intersection type discipline
inferred← citeshttps://doi.org/10.1007/3-540-13346-1_5openalex-snapshot
Using information systems to solve reoursive domain equations effectively
inferred← citeshttps://doi.org/10.1007/3-540-15648-8_28openalex-snapshot
Semantical analysis of specification logic
inferred← citeshttps://doi.org/10.1007/3-540-15670-4_12openalex-snapshot
Categories of models for concurrency
inferred← citeshttps://doi.org/10.1007/3-540-15670-4_18openalex-snapshot
Denotational models based on synchronously communicating processes: Refusal, acceptance, safety
inferred← citeshttps://doi.org/10.1007/3-540-15670-4_3openalex-snapshot
On the composition and decomposition of assertions
inferred← citeshttps://doi.org/10.1007/3-540-16042-6_22openalex-snapshot
A complete proof system for SCCS with modal assertions
inferred← citeshttps://doi.org/10.1007/3-540-16078-7_64openalex-snapshot
Some probabilistic powerdomains in the category SFP
inferred← citeshttps://doi.org/10.1007/3-540-16446-4_3openalex-snapshot
The theory of strictness analysis for higher order functions
inferred← citeshttps://doi.org/10.1007/3-540-16816-8_27openalex-snapshot
Comparing categories of domains
inferred← citeshttps://doi.org/10.1007/3-540-16816-8_33openalex-snapshot
A topological framework for cpos lacking bottom elements
inferred← citeshttps://doi.org/10.1007/3-540-17162-2_121openalex-snapshot
Category theory and programming language semantics: An overview
inferred← citeshttps://doi.org/10.1007/3-540-17162-2_125openalex-snapshot
Finite approximation of spaces
inferred← citeshttps://doi.org/10.1007/3-540-17187-8_31openalex-snapshot
A domain theoretic approach to higher-order relations
inferred← citeshttps://doi.org/10.1007/3-540-18317-5_21openalex-snapshot
Projections for strictness analysis
inferred← citeshttps://doi.org/10.1007/3-540-18508-9_29openalex-snapshot
Logical aspects of denotational semantics
inferred← citeshttps://doi.org/10.1007/3-540-19020-1_12openalex-snapshot
Quasi-uniformities: Reconciling domains with metric spaces
inferred← citeshttps://doi.org/10.1007/3-540-19020-1_2openalex-snapshot
A categorical approach to realizability and polymorphic types
inferred← citeshttps://doi.org/10.1007/3-540-19020-1_25openalex-snapshot
The semantics of Miranda's algebraic types
inferred← citeshttps://doi.org/10.1007/3-540-19488-6_125openalex-snapshot
Contractions in comparing concurrency semantics
inferred← citeshttps://doi.org/10.1007/3-540-19488-6_146openalex-snapshot
Type inference with partial types
inferred← citeshttps://doi.org/10.1007/3-540-39185-1_8openalex-snapshot
Two Behavioural Lambda Models
inferred← citeshttps://doi.org/10.1007/3-540-44622-2_18openalex-snapshot
Sequents, Frames, and Completeness
inferred← citeshttps://doi.org/10.1007/3-540-44881-0_33openalex-snapshot
Stable Computational Semantics of Conflict-Free Rewrite Systems (Partial Orders with Duplication)
inferred← citeshttps://doi.org/10.1007/3-540-45241-9_8openalex-snapshot
Soft Constraints for Security Protocol Analysis: Confidentiality
inferred← citeshttps://doi.org/10.1007/3-540-45500-0_22openalex-snapshot
Infinite Intersection and Union Types for the Lazy Lambda Calculus
inferred← citeshttps://doi.org/10.1007/3-540-45575-2_45openalex-snapshot
Abstract Computability of Non-deterministic Programs over Various Data Structures
inferred← citeshttps://doi.org/10.1007/3-540-45758-5_16openalex-snapshot
Knowledge Representation in Extended Pawlak’s Information Systems: Algebraic Aspects
inferred← citeshttps://doi.org/10.1007/3-540-47813-2_18openalex-snapshot
A Fully Abstract Model for Higher-Order Mobile Ambients
inferred← citeshttps://doi.org/10.1007/3-540-50241-6_38openalex-snapshot
Logic of approximation reasoning
inferred← citeshttps://doi.org/10.1007/3-540-50667-5_74openalex-snapshot
Babel: A functional and logic programming language based on constructor discipline and narrowing
inferred← citeshttps://doi.org/10.1007/3-540-51081-8_116openalex-snapshot
Algebraic semantics and complexity of term rewriting systems
inferred← citeshttps://doi.org/10.1007/3-540-52335-9_59openalex-snapshot
On connections between classical and constructive semantics
inferred← citeshttps://doi.org/10.1007/3-540-52513-0_24openalex-snapshot
Towards the semantics of the definitional language of MetaSoft
inferred← citeshttps://doi.org/10.1007/3-540-52513-0_27openalex-snapshot
A naive domain universe for VDM
inferred← citeshttps://doi.org/10.1007/3-540-52592-0_78openalex-snapshot
Towards the theory of programming in constructive logic
inferred← citeshttps://doi.org/10.1007/3-540-52753-2_36openalex-snapshot
Effectively given information systems and domains
inferred← citeshttps://doi.org/10.1007/3-540-54009-1_3openalex-snapshot
A relational algebra for complex objects based on partial information
inferred← citeshttps://doi.org/10.1007/3-540-54317-1_106openalex-snapshot
A fixed-point semantics for feature type systems
inferred← citeshttps://doi.org/10.1007/3-540-54415-1_43openalex-snapshot
An abstract interpretation for ML equality kinds
inferred← citeshttps://doi.org/10.1007/3-540-54535-2_25openalex-snapshot
A constraint-based language for querying taxonomic systems
inferred← citeshttps://doi.org/10.1007/3-540-55253-7_27openalex-snapshot
Modules for a model-oriented specification language: A proposal for metasoft
inferred← citeshttps://doi.org/10.1007/3-540-55511-0_13openalex-snapshot
Cartesian closed categories of domains and the space proj(D)
inferred← citeshttps://doi.org/10.1007/3-540-55511-0_8openalex-snapshot
Information links in domain theory
inferred← citeshttps://doi.org/10.1007/3-540-55610-9_168openalex-snapshot
Modular functional modelling of petri nets with individual tokens
inferred← citeshttps://doi.org/10.1007/3-540-55719-9_81openalex-snapshot
Disjunctive systems and L-Domains
inferred← citeshttps://doi.org/10.1007/3-540-56596-5_33openalex-snapshot
Compact metric information systems
inferred← citeshttps://doi.org/10.1007/3-540-56596-5_39openalex-snapshot
SPCF: its model, calculus, and computational power
inferred← citeshttps://doi.org/10.1007/3-540-56596-5_44openalex-snapshot
A hyperdoctrinal view of concurrent constraint programming
inferred← citeshttps://doi.org/10.1007/3-540-56735-6_44openalex-snapshot
A note on information systems associated to termal algebras
inferred← citeshttps://doi.org/10.1007/3-540-56992-8_14openalex-snapshot
On the completeness of narrowing as the operational semantics of functional logic programming
inferred← citeshttps://doi.org/10.1007/3-540-57787-4_18openalex-snapshot
Contextual occurrence nets and concurrent constraint programming
inferred← citeshttps://doi.org/10.1007/3-540-57880-3_13openalex-snapshot
A logical denotational semantics for constraint logic programming
inferred← citeshttps://doi.org/10.1007/3-540-57880-3_5openalex-snapshot
Foundational issues in implementing constraint logic programming systems
inferred← citeshttps://doi.org/10.1007/3-540-57887-0_88openalex-snapshot
Fully abstract semantics for concurrent λ-calculus
inferred← citeshttps://doi.org/10.1007/3-540-57887-0_99openalex-snapshot
Extensible denotational language specifications
inferred← citeshttps://doi.org/10.1007/3-540-58027-1_20openalex-snapshot
Probabilistic power domains, information systems, and locales
inferred← citeshttps://doi.org/10.1007/3-540-58027-1_22openalex-snapshot
Universal quasi-prime algebraic domains
inferred← citeshttps://doi.org/10.1007/3-540-58027-1_3openalex-snapshot
Computational adequacy via ‘mixed’ inductive definitions
inferred← citeshttps://doi.org/10.1007/3-540-58402-1_18openalex-snapshot
Clp(B): Combining simplicity and efficiency in boolean Constraint solving
inferred← citeshttps://doi.org/10.1007/3-540-58402-1_27openalex-snapshot
Combining lazy narrowing with disequality constraints
inferred← citeshttps://doi.org/10.1007/3-540-58402-1_6openalex-snapshot
Abstracting synchronization in concurrent constraint programming
inferred← citeshttps://doi.org/10.1007/3-540-58431-5_10openalex-snapshot
From eventual to atomic and locally atomic CC programs: A concurrent semantics
inferred← citeshttps://doi.org/10.1007/3-540-59155-9_10openalex-snapshot
Concurrency and Concurrent Constraint Programming
inferred← citeshttps://doi.org/10.1007/3-540-59175-3_89openalex-snapshot
Logic of plotkin continuous domain
inferred← citeshttps://doi.org/10.1007/3-540-59479-5_17openalex-snapshot
A generalized semantics for concurrent constraint languages and their abstract interpretation
inferred← citeshttps://doi.org/10.1007/3-540-60299-2_21openalex-snapshot
Guarded constructive disjunction: Angel or demon?
inferred← citeshttps://doi.org/10.1007/3-540-60299-2_22openalex-snapshot
Domain independent ask approximation in CCP
inferred← citeshttps://doi.org/10.1007/3-540-61604-7_72openalex-snapshot
Linear constraint systems as high-level nets
inferred← citeshttps://doi.org/10.1007/3-540-61735-3_20openalex-snapshot
Algebraic semantics for functional logic programming with polymorphic order-sorted types
inferred← citeshttps://doi.org/10.1007/3540539816_79openalex-snapshot
On narrowing strategies for partial non-strict functions
inferred← citeshttps://doi.org/10.1007/978-1-4471-1486-4_11openalex-snapshot
Model-Theoretical and Deductive Approaches to Databases from the Point of View of Algebraic Logic and Geometry
inferred← citeshttps://doi.org/10.1007/978-1-4471-3242-4_8openalex-snapshot
Situation Theory and Dempster-Shafer’s Theory of Evidence for Information Retrieval
inferred← citeshttps://doi.org/10.1007/978-1-4471-3421-3_9openalex-snapshot
On the Semantics of Concurrent Constraint Programming
inferred← citeshttps://doi.org/10.1007/978-1-4471-3503-6_13openalex-snapshot
On the Equivalence of State-Transition Systems
inferred← citeshttps://doi.org/10.1007/978-1-4471-3503-6_8openalex-snapshot
Self-duality, Minimal Invariant Objects and Karoubi Invariance in Information Categories
inferred← citeshttps://doi.org/10.1007/978-1-4471-3794-8_1openalex-snapshot
A Design Space for Integrating Declarative Languages
inferred← citeshttps://doi.org/10.1007/978-1-4612-0325-4_1openalex-snapshot
The Work of Anil Nerode: A Retrospective
inferred← citeshttps://doi.org/10.1007/978-1-4612-2566-9_13openalex-snapshot
Ordinal Bounds for Programs
inferred← citeshttps://doi.org/10.1007/978-1-4613-0897-3_12openalex-snapshot
Intuitionistic Formal Spaces — A First Communication
inferred← citeshttps://doi.org/10.1007/978-1-84996-074-8_16openalex-snapshot
Security in Distributed Collaborative Environments: Limitations and Solutions
inferred← citeshttps://doi.org/10.1007/978-3-030-15655-8_12openalex-snapshot
A Comparison of Type Theory with Set Theory
inferred← citeshttps://doi.org/10.1007/978-3-030-20447-1_19openalex-snapshot
Point-Free Spectra of Linear Spreads
inferred← citeshttps://doi.org/10.1007/978-3-030-25001-0_5openalex-snapshot
Information at the Threshold of Interpretation: Science as Human Construction of Sense
inferred← citeshttps://doi.org/10.1007/978-3-030-25719-4_18openalex-snapshot
Environment of Modeling Methods for Indicating Objects Based on Displaced Concepts
inferred← citeshttps://doi.org/10.1007/978-3-030-59267-7_28openalex-snapshot
Disjunctive Propositional Logic and Scott Domains
inferred← citeshttps://doi.org/10.1007/978-3-030-87348-6_1openalex-snapshot
The $$\mathbb {K}$$ Vision for the Future of Programming Language Design and Analysis
inferred← citeshttps://doi.org/10.1007/978-3-031-10363-6_12openalex-snapshot
Extending Process Algebra with an Undefined Action
inferred← citeshttps://doi.org/10.1007/978-3-031-20350-3_30openalex-snapshot
A Set-Theoretic Representation of Algebraic L-domains
inferred← citeshttps://doi.org/10.1007/978-3-031-20569-9_5openalex-snapshot
A General Description of Measuring Devices: Third Step—Subsets of Compatible Outcomes
inferred← citeshttps://doi.org/10.1007/978-3-031-20569-9_6openalex-snapshot
A General Description of Measuring Devices: Fourth Step—Conditional Statements About Possible Outcomes
inferred← citeshttps://doi.org/10.1007/978-3-031-66064-1_6openalex-snapshot
Provable Determinism for Software in Cyber-Physical Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-73709-1_23openalex-snapshot
Local Spaces in Soft Concurrent Constraint Programming Oriented to Security
inferred← citeshttps://doi.org/10.1007/978-3-032-16855-9_5openalex-snapshot
Fixed-Point Reasoning for Stochastic Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-10882-7_7openalex-snapshot
Probabilistic Recursion Theory and Implicit Computational Complexity
inferred← citeshttps://doi.org/10.1007/978-3-319-47286-7_1openalex-snapshot
Wherefore Art Thou $$\ldots $$ Semantics of Computation?
inferred← citeshttps://doi.org/10.1007/978-3-319-76578-5_18openalex-snapshot
Equational Security Proofs of Oblivious Transfer Protocols
inferred← citeshttps://doi.org/10.1007/978-3-540-27769-9_11openalex-snapshot
A Cartesian Closed Category of Approximable Concept Structures
inferred← citeshttps://doi.org/10.1007/978-3-540-30221-6_27openalex-snapshot
Default Reasoning over Domains and Concept Hierarchies
inferred← citeshttps://doi.org/10.1007/978-3-540-45187-7_25openalex-snapshot
Full Abstraction for HOPLA
inferred← citeshttps://doi.org/10.1007/978-3-540-72734-7_27openalex-snapshot
Compactness Properties for Stable Semantics of Logic Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-73681-3_27openalex-snapshot
Devolved Ontology for Smart Applications
inferred← citeshttps://doi.org/10.1007/978-3-540-77566-9_11openalex-snapshot
Recursive Domain Equations of Filter Models
inferred← citeshttps://doi.org/10.1007/978-3-642-00982-2_45openalex-snapshot
An Application of Generalized Complexity Spaces to Denotational Semantics via the Domain of Words
inferred← citeshttps://doi.org/10.1007/978-3-642-03281-3_1openalex-snapshot
Rough Set Theory: Ontological Systems, Entailment Relations and Approximation Operators
inferred← citeshttps://doi.org/10.1007/978-3-642-21691-6_19openalex-snapshot
Approximation Semantics and Expressive Predicate Assignment for Object-Oriented Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-25002-6_27openalex-snapshot
Completely Algebraic Lattices and Their Representations via ∩-structures and Information Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-34997-3_7openalex-snapshot
Mechanics and Mental Change
inferred← citeshttps://doi.org/10.1007/978-3-642-39634-2_27openalex-snapshot
Program Extraction from Nested Definitions
inferred← citeshttps://doi.org/10.1007/978-3-642-41218-9_31openalex-snapshot
Rough Set Granularity: Scott Systems Approach
inferred← citeshttps://doi.org/10.1007/978-3-642-58041-3_8openalex-snapshot
Minimal Logic for Computable Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-60539-0_5openalex-snapshot
Continuity ∑—Algebras (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-642-61455-2_10openalex-snapshot
Interaction Categories and the Foundations of Typed Concurrent Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-75040-3_38openalex-snapshot
The Concept of Information in Computer Science
inferred← citeshttps://doi.org/10.1007/978-3-642-76677-0_18openalex-snapshot
Primitive Recursion on the Partial Continuous Functionals
inferred← citeshttps://doi.org/10.1007/978-3-642-85983-0_8openalex-snapshot
Concurrent Semantics for Concurrent Constraint Programs
inferred← citeshttps://doi.org/10.1007/978-3-662-09691-8_14openalex-snapshot
On the Algebraic Specification of Domains
inferred← citeshttps://doi.org/10.1007/978-3-662-43951-7_18openalex-snapshot
Piecewise Boolean Algebras and Their Domains
inferred← citeshttps://doi.org/10.1007/978-3-7091-6597-3_27openalex-snapshot
Comparing the Church and Turing Approaches: Two Prophetical Messages
inferred← citeshttps://doi.org/10.1007/978-3-7908-1888-8_16openalex-snapshot
Information Systems, Similarity Relations and Modal Logics
inferred← citeshttps://doi.org/10.1007/978-90-481-3658-2_46openalex-snapshot
Information Systems via Epistemic States
inferred← citeshttps://doi.org/10.1007/978-94-009-3061-2_12openalex-snapshot
Probability, Randomness and Information
inferred← citeshttps://doi.org/10.1007/978-94-010-0654-5_9openalex-snapshot
Semantics of Logic Programs and Representation of Smyth Powerdomain
inferred← citeshttps://doi.org/10.1007/978-94-015-7975-9_24openalex-snapshot
Consequence Relations and Information Systems
inferred← citeshttps://doi.org/10.1007/978-94-017-0435-9_2openalex-snapshot
Proof Theory at Work: Program Development in the Minlog System
inferred← citeshttps://doi.org/10.1007/978-94-017-0487-8_11openalex-snapshot
From Higher Order Terms To Circuits
inferred← citeshttps://doi.org/10.1007/978-94-017-0697-1_3openalex-snapshot
Algebraic Ordered Sets and Their Generalizations
inferred← citeshttps://doi.org/10.1007/978-94-017-1291-0_8openalex-snapshot
On Minimal Event and Concrete Data Structures
inferred← citeshttps://doi.org/10.1007/978-94-017-1291-0_9openalex-snapshot
A Note on Strongly Finite Sequent Structures
inferred← citeshttps://doi.org/10.1007/978-94-017-1737-3_6openalex-snapshot
Probabilistic Argumentation Systems
inferred← citeshttps://doi.org/10.1007/978-981-13-1135-2_35openalex-snapshot
Reasoning for Uncertainty and Rough Set-Based Approach for an Efficient Biometric Identification: An Application Scenario
inferred← citeshttps://doi.org/10.1007/bf00239671openalex-snapshot
Interactions between linguistic constraints: Procedural vs. declarative approaches
inferred← citeshttps://doi.org/10.1007/bf00247670openalex-snapshot
A simple and efficient boolean solver for Constraint Logic Programming
inferred← citeshttps://doi.org/10.1007/bf00252182openalex-snapshot
A type-theoretic interpretation of constructive domain theory
inferred← citeshttps://doi.org/10.1007/bf00572989openalex-snapshot
Describing semantic domains with sprouts
inferred← citeshttps://doi.org/10.1007/bf00668706openalex-snapshot
Constructive description of the compact set of states
inferred← citeshttps://doi.org/10.1007/bf00668775openalex-snapshot
Hilbert space representation of time evolution of pure states
inferred← citeshttps://doi.org/10.1007/bf00669924openalex-snapshot
Dynamical transformations and information systems
inferred← citeshttps://doi.org/10.1007/bf00672648openalex-snapshot
On some definition of physical state
inferred← citeshttps://doi.org/10.1007/bf01069523openalex-snapshot
Composition aspects of programmology. II
inferred← citeshttps://doi.org/10.1007/bf01074922openalex-snapshot
Composition aspects of programmology. I
inferred← citeshttps://doi.org/10.1007/bf01384236openalex-snapshot
Annotations in formal specifications and proofs
inferred← citeshttps://doi.org/10.1007/bf01387405openalex-snapshot
Subrecursive hierarchies on Scott domains
inferred← citeshttps://doi.org/10.1007/bf01642506openalex-snapshot
Towards a semantics-based information theory
inferred← citeshttps://doi.org/10.1007/bf01806101openalex-snapshot
Combinator evaluation of functional programs with logical variables
inferred← citeshttps://doi.org/10.1007/bf02451553openalex-snapshot
On completeness theorems for feature logics
inferred← citeshttps://doi.org/10.1007/bf02943200openalex-snapshot
From concepts to consistent object specifications: Translation of a domain-oriented feature framework into practice
inferred← citeshttps://doi.org/10.1007/bf03037080openalex-snapshot
Complex indeterminates in Prolog and its application to discourse models
inferred← citeshttps://doi.org/10.1007/bf03354921openalex-snapshot
Modellierung von Fehlkonzepten in einer algebraischen Wissensstruktur
inferred← citeshttps://doi.org/10.1007/bfb0000459openalex-snapshot
Software configuration with information systems
inferred← citeshttps://doi.org/10.1007/bfb0013094openalex-snapshot
MIZ-PR: A theorem prover for polymorphic and recursive functions
inferred← citeshttps://doi.org/10.1007/bfb0013457openalex-snapshot
Collapsing graph models by preorders
showing the first 200 of 652 · page through all 652
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.