Achim Jung
- U. Berger. 1990. Totale Objekte und Mengen in der Bereichstheorie. Ph.D. Dissertation. Ludwig-Maximilians-Universität München.Google Scholar
- C. Gunter. 1992. Semantics of Programming Languages. Structures and Techniques. MIT Press. Google ScholarDigital Library
- J. R. Hindley and J. P. Seldin. 1986. Introduction to Combinators and λ-Calculus. Cambridge University Press. Google ScholarDigital Library
- J. C. Mitchell. 1996. Foundations for Programming Languages. MIT Press. Google ScholarDigital Library
- H. R. Nielson and F. Nielson. 1991. Semantics with Applications: A Formal Introduction for Computer Science. Wiley. Google ScholarDigital Library
- G. D. Plotkin. 1977. LCF Considered as a Programming Language. Theoretical Computer Science 5 (1977), 223--255.Google ScholarCross Ref
- D. A. Schmidt. 1986. Denotational Semantics. Allyn and Bacon.Google Scholar
- D. S. Scott. 1993. A type-theoretical alternative to ISWIM, CUCH, OWHY. Theoretical Computer Science 121 (1993), 411--440. Reprint of a manuscript written in 1969. Google ScholarDigital Library
- A. Simpson. 1998. Lazy functional algorithms for exact real functionals. In Mathematical Foundations of Computer Science 1998 (Lecture Notes in Computer Science), Vol. 1450. Springer Verlag, 456--464. Google ScholarDigital Library
- Th. Streicher. 2006. Domain-Theoretic Foundations of Functional Programming. World Scientific. 132pp. Google ScholarDigital Library
- R. D. Tennent. 1991. Semantics of Programming Languages. Prentice Hall.Google Scholar
- G. Winskel. 1993. The Formal Semantics of Programming Languages. An Introduction. MIT Press. Google ScholarDigital Library
Index Terms
- Semantics column
Recommendations
Solving Parallel Machine Scheduling Problems by Column Generation
<P>We consider a class of problems of scheduling n jobs on m identical, uniform, or unrelated parallel machines with an objective of minimizing an additive criterion. We propose a decomposition approach for solving these problems exactly. The ...
Column enumeration based decomposition techniques for a class of non-convex MINLP problems
We propose a decomposition algorithm for a special class of nonconvex mixed integer nonlinear programming problems which have an assignment constraint. If the assignment decisions are decoupled from the remaining constraints of the optimization problem, ...
Comments