ICFPC - researchr conference series publications

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 31 from 31

1981

Reducing Types in Applicative Languages with Structured DataEgidio Astesiano, Gerardo Costa. icfpc 1981: 210-217

The Algebra of Functional Programs: Function Level Reasoning, Linear Equations, and Extended DefinitionsJohn Backus. icfpc 1981: 1-43

On the Definition of Lamda-Calculus ModelsGérard Berry. icfpc 1981: 218-230

About Data Type GenericityDidier Bert, Roger Soler. icfpc 1981: 231-243

The VDM Principles of Software Specification and Program DesignDines Bjørner. icfpc 1981: 44-74

Scenarios: A Model of Non-Determinate ComputationJ. Dean Brock, William B. Ackerman. icfpc 1981: 252-259

On the Algebraic Extensions of Abstract Data TypesManfred Broy, Martin Wirsing. icfpc 1981: 244-251

Attribute Grammars: Theory and ApplicationsBruno Courcelle. icfpc 1981: 75-95

An Operational Semantics for a Language with Early Completion Data StructuresJack B. Dennis. icfpc 1981: 260-267

Le Calcul des Fermetures dans les Lamda-LangagesJean-Louis Durieux. icfpc 1981: 268-279

Formalization of Programming Concepts, International Colloquium, Peniscola, Spain, April 19-25, 1981, ProceedingsJosep Díaz, Isidro Ramos, editors, Volume 107 of Lecture Notes in Computer Science, Springer, 1981.

Distributed Termination with Interval AssertionsN. Frances, Michael Rodeh, Michel Sintzoff. icfpc 1981: 280-291

Compiler Generation from Formal Definition of Programming Languages: A SurveyMarie-Claude Gaudel. icfpc 1981: 96-114

Algebraic Denotational Semantics Using Parameterized Abstract ModulesJoseph A. Goguen, Kamran Parsaye-Ghomi. icfpc 1981: 292-309

Relational Semantics of Strongly Communicating Sequential ProcessesPedro Guerreiro. icfpc 1981: 310-326

A Construction of Concurrent Systems by Means of Sequential Solutions and Concurrency RelationsRyszard Janicki. icfpc 1981: 327-334

The Development of an Interpreter by Means of Abstract Algebraic Software SpecificationsHerbert Klaeren, Heiko Petzsch. icfpc 1981: 335-346

A Formal Model of an Interpreter for Nonprocedural LanguagesJuan M. Lafuente. icfpc 1981: 347-355

Formal Behavioural Specification of Concurrent Systems Without Globality AssumptionsPeter E. Lauer, M. W. Shields, John Yiannis Cotronis. icfpc 1981: 115-151

A Proof Theoretic Methodology for Propositional Dynamic LogicDaniel Leivant. icfpc 1981: 356-373

FP Systems in Edinburgh LCFJacek Leszczylowski. icfpc 1981: 374-386

A Proposal for Operational Semantics and Equivalence of Finite Asynchronous ProcessesLuis Mejia. icfpc 1981: 387-400

A Birkhoff-Like Theorem for Algebraic Classes of Interpretations of Program SchemesJosé Meseguer. icfpc 1981: 152-168

An Extension to Horn Clause Logic Allowing the Definition of Concurrent ProcessesLuís Monteiro. icfpc 1981: 401-407

A Semantic Algebra for Binding ConstructsPeter D. Mosses. icfpc 1981: 408-418

Building Data Base Management Systems Through Formal SpecificationErich J. Neuhold, Th. Olnhoff. icfpc 1981: 169-209

On the Representation of Data TypesFernando Orejas. icfpc 1981: 419-431

An Approach to Communications and Parallelism in Applicative LanguagesAlberto Pettorossi. icfpc 1981: 432-446

Using Last Fixed Points to Characterize Formal Computations of Non-Deterministic EquationsAxel Poigné. icfpc 1981: 447-459

Petri Nets and Concurrency-Like RelationsPiotr W. Prószynski. icfpc 1981: 471-478

Formal Representations for Recursively Defined Functional ProgramsJohn H. Williams. icfpc 1981: 460-470

Sign in or sign up to see more results.

runs on WebDSL