On the public citation graph

Functional programming and input/output

0 signed · 96 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.

Claim with ORCID

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.

See reference health

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/spe.4380250105openalex-snapshot

Extending a functional programming system for embedded applications

inferred← citeshttps://doi.org/10.1006/inco.1996.0008openalex-snapshot

Proving Congruence of Bisimulation in Functional Programming Languages

inferred← citeshttps://doi.org/10.1006/inco.1996.0031openalex-snapshot

Positive Subtyping

inferred← citeshttps://doi.org/10.1006/inco.1996.0061openalex-snapshot

From Operational Semantics to Domain Theory

inferred← citeshttps://doi.org/10.1007/11590156_11openalex-snapshot

Extending Howe’s Method to Early Bisimulations for Typed Mobile Embedded Resources with Local Names

inferred← citeshttps://doi.org/10.1007/3-540-44854-3_5openalex-snapshot

Proving Make Correct: I/O Proofs in Haskell and Clean

inferred← citeshttps://doi.org/10.1007/3-540-45022-x_5openalex-snapshot

A Statically Allocated Parallel Functional Language

inferred← citeshttps://doi.org/10.1007/3-540-45449-7_13openalex-snapshot

Directions in Functional Programming for Real(-Time) Applications

inferred← citeshttps://doi.org/10.1007/3-540-46028-4_5openalex-snapshot

Proving Correctness of Programs with IO —A Paradigm Comparison

inferred← citeshttps://doi.org/10.1007/3-540-48340-3_18openalex-snapshot

Unique Fixed Point Induction for McCarthy’s Amb

inferred← citeshttps://doi.org/10.1007/3-540-59451-5_5openalex-snapshot

Programming with Fudgets

inferred← citeshttps://doi.org/10.1007/3-540-61064-2_46openalex-snapshot

Untyped lambda-calculus with input-output

inferred← citeshttps://doi.org/10.1007/3-540-61626-8_90openalex-snapshot

Astro-Gofer: Parallel functional programming with co-ordinating processes

inferred← citeshttps://doi.org/10.1007/3-540-61628-4_1openalex-snapshot

Composing the user interface with Haggis

inferred← citeshttps://doi.org/10.1007/3-540-62688-3_45openalex-snapshot

Names, equations, relations: Practical ways to reason about new

inferred← citeshttps://doi.org/10.1007/978-1-4471-3236-3_2openalex-snapshot

Factoring an Adequacy Proof (Preliminary Report)

inferred← citeshttps://doi.org/10.1007/978-1-4471-3573-9_14openalex-snapshot

Experience of developing a cervical cytology scanning system using Gofer and Haskell

inferred← citeshttps://doi.org/10.1007/978-1-4471-3573-9_6openalex-snapshot

A Tutorial on Co-induction and Functional Programming

inferred← citeshttps://doi.org/10.1007/978-3-319-22969-0_17openalex-snapshot

A Formal Study of Backward Compatible Dynamic Software Updates

inferred← citeshttps://doi.org/10.1007/978-3-540-74915-8_23openalex-snapshot

Typed Normal Form Bisimulation

inferred← citeshttps://doi.org/10.1007/978-3-642-04027-6_33openalex-snapshot

A Complete Characterization of Observational Equivalence in Polymorphic λ-Calculus with General References

inferred← citeshttps://doi.org/10.1007/978-3-642-32096-5_3openalex-snapshot

Reasoning about I/O in Functional Programs

inferred← citeshttps://doi.org/10.1007/978-3-662-44124-4_1openalex-snapshot

Higher-Order Languages: Bisimulation and Coinductive Equivalences (Extended Abstract)

inferred← citeshttps://doi.org/10.1007/bf01806033openalex-snapshot

Categorical models for local names

inferred← citeshttps://doi.org/10.1007/bfb0014067openalex-snapshot

A fully abstract translation between a λ-calculus with reference types and Standard ML

inferred← citeshttps://doi.org/10.1007/bfb0014309openalex-snapshot

Semantic foundations for embedding HOL in Nuprl

inferred← citeshttps://doi.org/10.1007/bfb0022267openalex-snapshot

A sound metalogical semantics for input/output effects

inferred← citeshttps://doi.org/10.1007/s00165-015-0339-xopenalex-snapshot

Typed context awareness Ambient Calculus for pervasive applications

inferred← citeshttps://doi.org/10.1007/s001650200014openalex-snapshot

Variations on Algebra: Monadicity and Generalisations of Equational Therories

inferred← citeshttps://doi.org/10.1007/s10990-004-4868-xopenalex-snapshot

Bisimilarity for the Region Calculus

inferred← citeshttps://doi.org/10.1016/j.apal.2004.10.013openalex-snapshot

Axioms for strict and lazy functional programs

inferred← citeshttps://doi.org/10.1016/j.diin.2004.07.001openalex-snapshot

Formalization of computer input and output: the Hadley model

inferred← citeshttps://doi.org/10.1016/j.entcs.2004.09.041openalex-snapshot

Congruence of Bisimulation in a Non-Deterministic Call-By-Need Lambda Calculus

inferred← citeshttps://doi.org/10.1016/j.entcs.2006.04.013openalex-snapshot

An Operational Domain-theoretic Treatment of Recursive Types

inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00033-7openalex-snapshot

Input/Output for ELAN

inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80013-6openalex-snapshot

Bisimilarity as a Theory of Functional Programming

inferred← citeshttps://doi.org/10.1016/s1571-0661(05)01465-9openalex-snapshot

Electronic Notes in Theoretical Computer Science

inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80280-4openalex-snapshot

Monads, Effects and Transformations

inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80691-7openalex-snapshot

Monadic Type Systems: Pure Type Systems for Impure Settings (Preliminary Report)

inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80704-2openalex-snapshot

Similarity and Bisimilarity for Countable Non-Determinism and Higher-Order Functions (Extended Abstract)

inferred← citeshttps://doi.org/10.1017/cbo9780511526619.007openalex-snapshot

Operationally-Based Theories of Program Equivalence

inferred← citeshttps://doi.org/10.1017/cbo9781139032636openalex-snapshot

Lambda Calculus with Types

inferred← citeshttps://doi.org/10.1017/s0956796800001258openalex-snapshot

The ins and outs of Clean I/O

inferred← citeshttps://doi.org/10.1017/s0956796898002998openalex-snapshot

Computational types from a logical perspective

inferred← citeshttps://doi.org/10.1017/s0956796899003482openalex-snapshot

Compilation and equivalence of imperative objects

inferred← citeshttps://doi.org/10.1017/s095679689921324xopenalex-snapshot

Advanced Functional Programming edited by John Lauchbury, Erik Meijer and Tim Sheard, Lecture Notes in Computer Science 1129 , Springer-Verlag, 1996.

inferred← citeshttps://doi.org/10.1017/s0960129597002405openalex-snapshot

A computational formalization for partial evaluation

inferred← citeshttps://doi.org/10.1017/s0960129597002417openalex-snapshot

Action semantics reasoning about functional programs

inferred← citeshttps://doi.org/10.1017/s0960129598002709openalex-snapshot

Relating operational and denotational semantics for input/output effects

inferred← citeshttps://doi.org/10.1051/ita:2002008openalex-snapshot

Semantics of value recursion for Monadic Input/Output

inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198566519.003.0007openalex-snapshot

INTERACTIVE PROGRAMS AND WEAKLY FINAL COALGEBRAS IN DEPENDENT TYPE THEORY

inferred← citeshttps://doi.org/10.1093/jigpal/5.4.589openalex-snapshot

A note on logical relations between semantics and syntax

inferred← citeshttps://doi.org/10.1093/jigpal/9.1.27openalex-snapshot

Completeness of bisimilarity for contextual equivalence in linear theories

inferred← citeshttps://doi.org/10.1109/iccsnt.2012.6525934openalex-snapshot

Decidable logic in the design of functional languages

inferred← citeshttps://doi.org/10.1109/lics.1995.523261openalex-snapshot

A fully abstract semantics for a concurrent functional language with monadic types

inferred← citeshttps://doi.org/10.1109/lics.1998.705668openalex-snapshot

Coinductive techniques for operational equivalence of interaction nets

inferred← citeshttps://doi.org/10.1109/lics.2007.17openalex-snapshot

Environmental Bisimulations for Higher-Order Languages

inferred← citeshttps://doi.org/10.1109/lics56636.2023.10175778openalex-snapshot

Fully Abstract Normal Form Bisimulation for Call-by-Value PCF

inferred← citeshttps://doi.org/10.1142/9781848161023_0004openalex-snapshot

TYPE INFERENCE AND SUBTYPING FOR HIGHER-ORDER GENERATIVE COMMUNICATION

inferred← citeshttps://doi.org/10.1145/1011508.1011509openalex-snapshot

First-class monadic schedules

inferred← citeshttps://doi.org/10.1145/1159803.1159823openalex-snapshot

Modelling deterministic concurrent I/O

inferred← citeshttps://doi.org/10.1145/1291201.1291206openalex-snapshot

Beauty in the beast

inferred← citeshttps://doi.org/10.1145/1596550.1596589openalex-snapshot

A concurrent ML library in concurrent Haskell

inferred← citeshttps://doi.org/10.1145/165180.165199openalex-snapshot

An operational semantics for I/O in a lazy functional language

inferred← citeshttps://doi.org/10.1145/1889997.1890002openalex-snapshot

Environmental bisimulations for higher-order languages

inferred← citeshttps://doi.org/10.1145/1926354.1926362openalex-snapshot

Computing with streams

inferred← citeshttps://doi.org/10.1145/224164.224185openalex-snapshot

First-class schedules and virtual maps

inferred← citeshttps://doi.org/10.1145/224164.224193openalex-snapshot

Compiler correctness for parallel languages

inferred← citeshttps://doi.org/10.1145/237721.237807openalex-snapshot

Bisimilarity for a first-order calculus of objects with subtyping

inferred← citeshttps://doi.org/10.1145/262009.262011openalex-snapshot

How to declare an imperative

inferred← citeshttps://doi.org/10.1145/263699.263755openalex-snapshot

Denotational semantics using an operationally-based term model

inferred← citeshttps://doi.org/10.1145/289121.289134openalex-snapshot

Foundations for partial evaluation of functional programs with computational effects

inferred← citeshttps://doi.org/10.1145/289423.289430openalex-snapshot

A theory of core fudgets

inferred← citeshttps://doi.org/10.1145/291251.289430openalex-snapshot

A theory of core fudgets

inferred← citeshttps://doi.org/10.1145/3167081openalex-snapshot

Triangulating context lemmas

inferred← citeshttps://doi.org/10.1145/317636.317906openalex-snapshot

Flexible type analysis

inferred← citeshttps://doi.org/10.1145/317765.317906openalex-snapshot

Flexible type analysis

inferred← citeshttps://doi.org/10.1145/351268.351287openalex-snapshot

A model for comparing the space usage of lazy evaluators

inferred← citeshttps://doi.org/10.17863/cam.15863openalex-snapshot

Names and higher-order functions.

inferred← citeshttps://doi.org/10.2307/421013openalex-snapshot

The Impact of the Lambda Calculus in Logic and Computer Science

inferred← citeshttps://doi.org/10.31274/etd-180810-601openalex-snapshot

situ-f: a domain specific language and a first step towards the realization of situ framework

inferred← citeshttps://doi.org/10.3233/fi-1998-33403openalex-snapshot

Names, Equations, Relations: Practical Ways to Reason about new

inferred← citeshttps://doi.org/10.3929/ethz-a-006714609openalex-snapshot

Axioms for strict and lazy functional programs

inferred← citeshttps://doi.org/10.4204/eptcs.131.1openalex-snapshot

Coinductive techniques for higher-order languages

inferred← citeshttps://doi.org/10.4230/dagsemproc.04381.2openalex-snapshot

Interactive Programs and Weakly Final Coalgebras in Dependent Type Theory (Extended Version)

inferred← citeshttps://doi.org/10.4230/lipics.mfcs.2023.37openalex-snapshot

Inductive Continuity via Brouwer Trees

inferred← citeshttps://doi.org/10.48550/arxiv.0805.4029openalex-snapshot

Event Synchronization by Lightweight Message Passing

inferred← citeshttps://doi.org/10.48550/arxiv.1410.2833openalex-snapshot

On Coupled Logical Bisimulation for the Lambda-Calculus

inferred← citeshttps://doi.org/10.48550/arxiv.1503.07235openalex-snapshot

A Formal Study on Backward Compatible Dynamic Software Updates

inferred← citeshttps://doi.org/10.48550/arxiv.2001.01337openalex-snapshot

A Diagrammatic Calculus for Algebraic Effects

inferred← citeshttps://doi.org/10.5525/gla.thesis.4609openalex-snapshot

Supporting formal reasoning about functional programs

inferred← citeshttps://doi.org/10.6083/m4736ntxopenalex-snapshot

High-Level Abstractions for Low-Level Programming

inferred← citeshttps://doi.org/10.7146/brics.v3i34.20015openalex-snapshot

A Computational Formalization for Partial Evaluation (Extended Version)

inferred← citeshttps://doi.org/10.7146/brics.v4i24.18950openalex-snapshot

Relational Reasoning about Contexts

inferred← citeshttps://doi.org/10.7146/brics.v4i39.18965openalex-snapshot

Names, Equations, Relations: Practical Ways to Reason about new

inferred← citeshttps://doi.org/10.7146/brics.v5i55.19500openalex-snapshot

Compilation and Equivalence of Imperative Objects (Revised Report)

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.