Assignments for Applicative Languages

No abstract is available for this paper.

• Publication year

  1991

• Venue

  Conference on Functional Programming Languages and Computer Architecture

• Publication date

  1991-06-01

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1007/3540543961_10
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Applications of Categories in Computer Science: Semantics of local variables

  1992cited by this paper
• Type Theoretic Properties of Assignments

  1992cited by this paper
• Inferring the Equivalence of Functional Programs That Mutate Data

  1992cited by this paper
• Type Theoretic Properties of Assignments

  1992cited by this paper
• The essence of functional programming

  1992cited by this paper
• Report on the programming language Haskell: a non-strict, purely functional language version 1.2

  1992cited by this paper
• The Revised Report on the Syntactic Theories of Sequential Control and State

  1992cited by this paper
• A Logical View of Assignments

  1992cited by this paper
• Notions of Computation and Monads

  1991cited by this paper
• Projection factorisations in partial evaluation

  1991cited by this paper
• Is there a use for linear logic

  1991cited by this paper
• Type Systems for Programming Languages

  1991cited by this paper
• Semantic Domains

  1991cited by this paper
• Is there a use for linear logic?

  1991cited by this paper
• Equivalence in functional languages with effects

  1991cited by this paper
• Comprehending monads

  1990cited by this paper
• Definition of standard ML

  1990cited by this paper
• Single-threaded polymorphic lambda calculus

  1990cited by this paper
• Linear Types can Change the World!

  1990cited by this paper
• A Sound and Complete Axiomatization of OperationalEquivalence between Programs with Memory

  1989cited by this paper
• Syntactic Control of Inference, Part 2

  1989cited by this paper
• A Syntactic Theory of Sequential State

  1989cited by this paper
• On the Expressiveness of Purely Functional I/O Systems

  1989cited by this paper
• Why Functional Programming Matters

  1989cited by this paper
• A sound and complete axiomatization of operational equivalence of programs with memory

  1989cited by this paper
• Axiomatizing operational equivalence in the presence of side effects

  1989cited by this paper
• Proofs and types

  1989cited by this paper
• Preliminary design of the programming language Forsythe

  1988cited by this paper
• Polymorphic effect systems

  1988cited by this paper
• &lgr;-V-CS: an extended &lgr;-calculus for scheme

  1988cited by this paper
• Operational Semantics and Polymorphic Type Inference

  1988cited by this paper
• A calculus for assignments in higher-order languages

  1987cited by this paper
• Projections for strictness analysis

  1987cited by this paper
• Laws of programming

  1987cited by this paper
• Integrating functional and imperative programming

  1986cited by this paper
• Revised3 report on the algorithmic language scheme

  1986cited by this paper
• The Finitary Projection Model for Second Order Lambda Calculus and Solutions to Higher Order Domain Equations

  1986cited by this paper
• On understanding types, data abstraction, and polymorphism

  1985cited by this paper
• Detecting global variables in denotational specifications

  1985cited by this paper
• Semantical Analysis of Specification Logic

  1985cited by this paper
• The aggregate update problem in functional programming systems

  1985cited by this paper
• The semantics of local storage, or what makes the free-list free?(Preliminary Report)

  1984cited by this paper
• A category-theoretic approach to the semantics of programming languages

  1982cited by this paper
• Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory

  1981cited by this paper
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems

  1980cited by this paper
• Syntactic control of interference

  1978cited by this paper
• Conflunt reductions: Abstract properties and applications to term rewriting systems

  1977cited by this paper
• Data Types as Lattices

  1976cited by this paper
• A realizability interpretation of the theory of species

  1975cited by this paper
• Report on the Algorithmic Language

  1971cited by this paper
• Ideas and Results in Proof Theory

  1971cited by this paper
• Intensional interpretations of functionals of finite type I

  1967cited by this paper
• A Machine-Oriented Logic Based on the Resolution Principle

  1965cited by this paper

• Theoretical Computer Science: 42nd National Conference, NCTCS 2024, Qingdao, China, July 19–21, 2024, Revised Selected Papers

  2025cites this paper
• Intersection types for a λ-calculus with global store

  2021cites this paper
• Intersection Types for a Computational Lambda-Calculus with Global State

  2021cites this paper
• Automata-Theoretic Semantics of Idealized Algol with Passive Expressions

  2013cites this paper
• Type inference and optimisation for an impure world

  2009cites this paper
• Referential Transparen y in Imperative Languages

  2007cites this paper
• Categorical Models of Syntactic Control of Intereference Revisited, Revisited

  2007cites this paper
• 1 Equivalence in Functional Languages with E ectsIan

  2007cites this paper
• A Type System for Functional Imperative Programming (Technical Summary)

  2005cites this paper
• Recursive XML schemas, recursive XML queries, and relational storage: XML-to-SQL query translation

  2004cites this paper
• Linearity and Passivity

  2003cites this paper
• Objects and Classes in Algol-Like Languages

  2002cites this paper
• A Fully Abstract Relational Model of Syntactic Control of Interference

  2002cites this paper
• Monadic encapsulation of effects: a revised approach (extended version)

  2001cites this paper
• An Introduction to Functional Nets

  2000cites this paper
• An Overview of Functional Nets

  2000cites this paper
• University of Birmingham Objects and Classes in Algol-like Languages

  2000cites this paper
• Functional Nets

  2000cites this paper
• Monadic encapsulation in ML

  1999cites this paper
• Type reconstruction for syntactic control of interference. 2

  1998cites this paper
• What is a purely functional language?

  1998cites this paper
• Applicative Notions in ML-like Programs

  1998cites this paper
• Correctness of monadic state: an imperative call-by-need calculus

  1998cites this paper
• The essence of functional programming (Invited talk)

  1997cites this paper
• Formal operation definition in object-oriented databases

  1997cites this paper
• Monadic state: axiomatization and type safety

  1997cites this paper
• Type Reconstruction for SCI , Part 2 Hongseok

  1997cites this paper
• Imperative Lambda Calculus Revisited

  1997cites this paper
• Toward a complete transformational toolkit for compilers

  1997cites this paper
• Formal operation definition in object-oriented databases

  1997cites this paper
• ALGOL and functional programming

  1997cites this paper
• A Complete Transformational Toolkit for Compilers

  1996cites this paper
• Imperative functional programming

  1996cites this paper
• Applying pi: towards a basis for concurrent imperative programming

  1996cites this paper
• Global state considered unnecessary: An introduction to object-based semantics

  1996cites this paper
• Towards a complete transformational toolkit for compilers

  1996cites this paper
• Note on Algol and conservatively extending functional programming

  1996cites this paper
• Strictness analysis in the Imperative Lambda Calculus

  1996influential citation
• Calculi for functional programming languages with assignment

  1996influential citation
• The formal relationship between direct and continuation-passing style optimizing compilers - a synthesis of two paradigms

  1996influential citation
• A Complete Transformational Toolkit for Compilers a Complete Transformational Toolkit for Compilers a Complete Transformational Toolkit for Compilers

  1996cites this paper
• 10-12 July 1995 Paper : Type Reconstruction for SCI

  1996influential citation
• Chapter 5 on the Orthogonality of Assignments and Procedures in Algol

  1996cites this paper
• Label-selective lambda-calculi and transformation calculi

  1995cites this paper
• State in Haskell

  1995cites this paper
• Isolating side effects in sequential languages

  1995cites this paper
• The Transformation Calculus

  1995cites this paper
• Type Reconstruction for SCI

  1995influential citation
• Encapsulated Eeects

  1995cites this paper
• Monads for functional programming

  1995cites this paper
• A Type System for Functional Imperative Programming

  1994cites this paper
• Parallel destructive updating in strict functional languages

  1994cites this paper
• A Type System for a Lambda Calculus with Assignments

  1994cites this paper
• Names and higher-order functions

  1994cites this paper
• Lazy functional state threads

  1994cites this paper
• A functional theory of local names

  1994cites this paper
• A linear logic model of state

  1993cites this paper
• Reasoning about Explicit and Implicit Representations of State

  1993cites this paper
• Call by name, assignment, and the lambda calculus

  1993cites this paper
• A model for syntactic control of interference

  1993cites this paper
• From VDM Speci cations to Functional

  1993cites this paper
• Fips: a functional-imperative language for explorative programming

  1993cites this paper
• A Linear Logic Model of State ( Extended Abstract )

  1993cites this paper
• On the orthogonality of assignments and procedures in Algol

  1993cites this paper
• Lazy Imperative

  1993cites this paper
• Imperative functional programming

  1993cites this paper
• From VDM specifications to functional prototypes

  1993cites this paper
• Observers for Linear Types

  1992cites this paper
• Type Theoretic Properties of Assignments

  1992cites this paper
• The essence of functional programming

  1992cites this paper
• A Logical View of Assignments

  1992cites this paper
• Arrays in Imperative Lambda Calculus ( Extended abstract )

  1992cites this paper
• Arrays in Imperative Lambda

  1992influential citation
• Yale UniversityDepartment of Computer ScienceCall by Name , Assignment , and the LambdaCalculus 1

  1992cites this paper
• Equivalence in functional languages with effects

  1991cites this paper
• Acceptors as Values Functional Programming in Classical Linear Logic (Technical Summary)

  1991cites this paper
• {51 () State in Haskell

  year unknowncites this paper
• REPORT RAPPORT

  year unknowncites this paper