Filters








42 Hits in 6.9 sec

Page 2860 of Mathematical Reviews Vol. , Issue 94e [page]

1994 Mathematical Reviews  
In Chapter 4, the constructor-selector problem is solved using the represented order-sorted approach. Fi- nally, Chapter 5 deals with multiple representations, coercions, and degenerate cases.  ...  Gianfranco Mascari (Rome) 94e:68123 68Q65 08A70 68Q42 68Q55 Meseguer, José (1-SRI; Menlo Park, CA); Goguen, Joseph A. (4-OX-PR; Oxford) Order-sorted algebra solves the constructor-selector, multiple representation  ... 

Page 6028 of Mathematical Reviews Vol. , Issue 88k [page]

1988 Mathematical Reviews  
Meseguer, Order-sorted algebra solves the constructor-selector, multiple rep- resentation and coercion problems (pp. 18-29); N.  ...  Pratt [Vaughan Pratt], Partial order models of concurrency and the computation of functions (pp. 72-85); N. Bidoit and C.  ... 

Checking Class Schema Usefulness

Jean-Claude Royer
2004 Journal of Object Technology  
We present a general process to check this and a static algorithm which applies to the UML language.  ...  We consider an approach based on the notion of class usefulness, i.e. finitely generated and with at least one defined value.  ...  Acknowledgments The author thanks Yann-Gal Guhuneuc and Pascal Poizat for their careful reading of previous versions of this paper, and their insightful comments.  ... 
doi:10.5381/jot.2004.3.1.a4 fatcat:zzcxln7abfa5jgmrxwy37ei3ca

A hidden agenda

Joseph Goguen, Grant Malcolm
2000 Theoretical Computer Science  
This paper publicly reveals, motivates, and surveys the results of an ambitious hidden agenda for applying algebra to software engineering.  ...  We also discuss where modularization, bisimulation, transition systems and combinations of the object, logic, constraint and functional paradigms ÿt into our hidden agenda.  ...  REusability) and 6112, COMPASS (COMPrehensive Algebraic Approach to System Speciÿcation and development), a contract under the management of the Information Technology Promotion Agency (IPA), Japan, as  ... 
doi:10.1016/s0304-3975(99)00275-3 fatcat:z6ivbv4ssfcdpck5whjx3e5zvm

Metalevel algorithms for variant satisfiability

Stephen Skeirik, José Meseguer
2018 Journal of Logical and Algebraic Methods in Programming  
a poset of sorts pS, ¤q; (iii) sensible OS signature; (iv) order-sorted Σalgebras and homomorphisms, and its associated category OSAlg Σ ; and (v) the construction of the term algebra T Σ and its initiality  ...  Variant satisfiability is a theory-generic algorithm to decide quantifier-free satisfiability in an initial algebra T Σ{E when the theory pΣ, Eq has the finite variant property and its constructors satisfy  ...  .: Order-sorted algebra solves the constructor-selector, multiple representation and coercion problems. Information and Computation 103(1), 114-158 (1993) 30.  ... 
doi:10.1016/j.jlamp.2017.12.006 fatcat:kvxues2kxjgs5bedi4gxucrbxe

The Coq Proof Assistant, version 8.10.0 [article]

The Coq Development Team
2019 Zenodo  
The SProp sort of definitionally proof-irrelevant propositions was introduced. SProp allows to mark proof terms as irrelevant for conversion, and is treated like Prop during extraction.  ...  Coq version 8.10 contains two major new features: support for a native fixed-precision integer type and a new sort SProp of strict propositions.  ...  Acknowledgments The authors would like to thank Frédéric Blanqui, François Pottier and Laurence Rideau for their comments and suggestions.  ... 
doi:10.5281/zenodo.3476303 fatcat:nq2hvuywmre3xmbaqly2xxt6za

The Coq Proof Assistant, version 8.9.0 [article]

The Coq Development Team
2019 Zenodo  
Coq version 8.9 contains the result of refinements and stabilization of features and deprecations or removals of deprecated features, cleanups of the internals of the system and API along with a few new  ...  of mathematics (e.g. the full formalization of the Feit-Thompson theorem or homotopy type theory) and teaching.  ...  Acknowledgments The authors would like to thank Frédéric Blanqui, François Pottier and Laurence Rideau for their comments and suggestions.  ... 
doi:10.5281/zenodo.2554024 fatcat:3e4xv3rahjfcplmzrgd3me46gy

Formalizing mathematics in higher-order logic: A case study in geometric modelling

François Puitg, Jean-François Dufourd
2000 Theoretical Computer Science  
A hierarchical speciÿcation of ordered sorts is presented and validated by inductive proofs of consistency and completeness in the Coq system, a prover built on CIC.  ...  Geometrical modelling issues are thus solved in a new and unquestionable fashion, giving a great insight on the domain and a deep understanding of the model.  ...  It is su ciently powerful to recover our algebraic speciÿcation background into a single higher-order logical framework, in which our past di culties with ordered sorts and preconditions may be solved,  ... 
doi:10.1016/s0304-3975(98)00228-x fatcat:2u5nya5zmrczlk3xuizah6stpi

The history of Standard ML

David MacQueen, Robert Harper, John Reppy
2020 Proceedings of the ACM on Programming Languages (PACMPL)  
The paper covers the early history of ML, the subsequent efforts to define a standard ML language, and the development of its major features and its formal definition.  ...  Standard ML, and the ML family of languages, have had enormous influence on the world of programming language design and theory.  ...  structure Y : SORT ) = struct . . . end where it is important that X and Y have sort functions with respect to the same ordering function le (necessarily over the same type).  ... 
doi:10.1145/3386336 fatcat:2hrtsaf5azfe3htngsqvxv3kre

The Coq Proof Assistant, Version 8.7.2 [article]

The Coq Development Team
2018 Zenodo  
, providing a safer API to plugin writers and making the code more robust.  ...  The SSReflect plugin by Georges Gonthier, Assia Mahboubi and Enrico Tassi was integrated (with its documentation in the reference manual) by Maxime Dénès, Assia Mahboubi and Enrico Tassi.  ...  Acknowledgments The authors would like to thank Frédéric Blanqui, François Pottier and Laurence Rideau for their comments and suggestions.  ... 
doi:10.5281/zenodo.1174360 fatcat:ewr4sjw56bep7ej7j34qmpm74i

The Coq Proof Assistant, Version 8.7.1 [article]

The Coq Development Team
2017 Zenodo  
, providing a safer API to plugin writers and making the code more robust.  ...  The SSReflect plugin by Georges Gonthier, Assia Mahboubi and Enrico Tassi was integrated (with its documentation in the reference manual) by Maxime Dénès, Assia Mahboubi and Enrico Tassi.  ...  Acknowledgments The authors would like to thank Frédéric Blanqui, François Pottier and Laurence Rideau for their comments and suggestions.  ... 
doi:10.5281/zenodo.1133970 fatcat:r426i2vxujfqviuefbs5ytsnfu

Pizza into Java

Martin Odersky, Philip Wadler
1997 Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '97  
Pizza is a strict superset of Java that incorporates three ideas from the academic community: parametric polymorphism, higher-order functions, and algebraic data types.  ...  Pizza is defined by translation into Java and compiles into the Java Virtual Machine, requirements which strongly constrain the design space.  ...  Acknowledgments We'd like to thank the anonymous referees for their thorough and helpful comments.  ... 
doi:10.1145/263699.263715 dblp:conf/popl/OderskyW97 fatcat:oblajhv3g5dqlouvh3ieb2sfjq

Programs and Proofs: Mechanizing Mathematics with Dependent Types [article]

Ilya Sergey
2014 Zenodo  
This project contains the Coq sources, the lectures and the exercises for the course Programs and Proofs: Mechanizing Mathematics with Dependent Types.  ...  To build the sources, follow the instructions from README.md in the root folder.  ...  Using selectors and discharging subgoals Let us restart this proof and show an alternative way to structure the proof script, which should account for multiple cases.  ... 
doi:10.5281/zenodo.4996238 fatcat:34mga3vdkjhdtfksnjiwu6yknq

Introducing OBJ [chapter]

Joseph A. Goguen, Timothy Winkler, José Meseguer, Kokichi Futatsugi, Jean-Pierre Jouannaud
2000 Advances in Formal Methods  
Order sorted algebra provides a notion of subsort that rigorously supports multiple inheritance, exception handling and overloading.  ...  including multiple parses of least sort.  ...  Sort-Order This selector provides access to the sort order for the given module, i.e., the representation of the sort structure. sort order$is included in : Sort-Order Sort Sort !  ... 
doi:10.1007/978-1-4757-6541-0_1 fatcat:p43wswo5drag7fvuxwkkchq4ue

Multiparadigm Programming with Object-Oriented Languages [chapter]

Kei Davis, Yannis Smaragdakis, Jörg Striegnitz
2002 Lecture Notes in Computer Science  
Building a consensus about the standard background work, the interesting problems, and the future directions is the way to form a community. Acknowledgment.  ...  With respect to software quality, it is therefore desirable to let the problem domain determine the choice of the programming paradigm.  ...  Acknowledgements The authors would like to thank the other members of the Modelica Association for inspiring discussions and their contributions to the Modelica language design.  ... 
doi:10.1007/3-540-36208-8_13 fatcat:woa75p6fzbgpzjvlwi3epx6nle
« Previous Showing results 1 — 15 out of 42 results