SIGPLAN Notices
2005
- Tina: an improbable 3-pin microcontrollerby: Paul Frenger v. 40 i. 2 p. 5 - 10
- Adaptable Java Agents (AJA): a tool for programming of multi-agent systemsby: Mihal Badjonski, Mirjana Ivanovic, Zoran Budimac v. 40 i. 2 p. 17 - 26
- An efficient and reliable object-oriented exception handling mechanismby: Shujuan Jiang, Baowen Xu v. 40 i. 2 p. 27 - 32
- Loop-dead optimizationby: Sachin Shaw, Pawan Kumar v. 40 i. 2 p. 33 - 40
- Requirements for a real-time .NET frameworkby: A. Zerzelidis, Andy J. Wellings v. 40 i. 2 p. 41 - 50
- Dutch treatby: Paul Frenger v. 39 i. 2 p. 7 - 10
- Adding the leads-to operator to Dijkstra's calculusby: Awadhesh Kumar Singh, Anup Kumar Bandyopadhyay v. 39 i. 2 p. 12 - 17
- A compile-time optimization framework for Ada rendezvousby: Hongmin Lu, Yuming Zhou, Jiangtao Lu, Baowen Xu v. 39 i. 2 p. 18 - 25
- What can we gain by unfolding loops?by: Litong Song, Krishna M. Kavi v. 39 i. 2 p. 26 - 33
- Process algebra model of Ada protected objectsby: Yuan Liu, Baowen Xu v. 39 i. 2 p. 34 - 39
- Deus Ex Macintoshby: Paul Frenger v. 39 i. 3 p. 7 - 11
- A survey of semantic description frameworks for programming languagesby: Yingzhou Zhang, Baowen Xu v. 39 i. 3 p. 14 - 30
- Back-propagation of knowledge from syntax tree to C source codeby: Jonathan Yavner v. 39 i. 3 p. 31 - 37
- When and what to compile/optimize in a virtual machine?by: K. V. Seshu Kumar v. 39 i. 3 p. 38 - 45
- Generalized typestate checking using set interfaces and pluggable analysesby: Patrick Lam, Viktor Kuncak, Martin C. Rinard v. 39 i. 3 p. 46 - 55
- Sexy types in actionby: Chung-chieh Shan v. 39 i. 5 p. 15 - 22
- Generics in Java and C++: a comparative modelby: Debasish Ghosh v. 39 i. 5 p. 40 - 47
- A universal intermediate representation for massively parallel software developmentby: Paul Damian Wells v. 39 i. 5 p. 48 - 57
- Java RMI, RMI tunneling and Web services comparison and performance analysisby: Matjaz B. Juric, Bostjan Kezmah, Marjan Hericko, Ivan Rozman, Ivan Vezocnik v. 39 i. 5 p. 58 - 65
- Lexical analysis toolby: Isaiah Pinchas Kantorovitz v. 39 i. 5 p. 66 - 74
- Embed with Forthby: Paul Frenger v. 39 i. 8 p. 8 - 11
- Parsing by numbers and asparagusby: G. Alan Creak v. 39 i. 8 p. 12 - 19
- An overview of Fortran 2003by: John K. Reid v. 39 i. 8 p. 31 - 38
- Slicing Z specificationsby: Fangjun Wu, Tong Yi v. 39 i. 8 p. 39 - 48
- A practical adoption of partial redundancy eliminationby: Dmitri Bronnikov v. 39 i. 8 p. 49 - 53
- Closures for statically-typed object-oriented languagesby: José de Oliveira Guimarães v. 39 i. 8 p. 54 - 60
- Method driven model: a unified model for an object composition languageby: Chitra Babu, D. Janaki Ram v. 39 i. 8 p. 61 - 71
- Jazzing up JVMs with off-line profile data: does it pay?by: S. M. Sandya v. 39 i. 8 p. 72 - 80
- Forth and AI revisited: BRAIN.FORTHby: Paul Frenger v. 39 i. 12 p. 11 - 16
- Parametric polymorphism for Java: is there any hope in sight?by: Brian Cabana, Suad Alagic, Jeff Faulkner v. 39 i. 12 p. 22 - 31
- Checking spelling in source codeby: Elliott Hughes v. 39 i. 12 p. 32 - 38
- Notes on notes on postmodern programmingby: James Noble, Robert Biddle v. 39 i. 12 p. 40 - 56
- Looking for love (in all the wrong places)by: David West v. 39 i. 12 p. 57 - 63
- Methodology work is ontology workby: Brian Marick v. 39 i. 12 p. 64 - 72
- Protocols for processes: programming in the large for open systemsby: Munindar P. Singh, Amit K. Chopra, Nirmit Desai, Ashok U. Mallya v. 39 i. 12 p. 73 - 83
- Example centric programmingby: Jonathan Edwards v. 39 i. 12 p. 84 - 91
- Finding bugs is easyby: David Hovemeyer, William Pugh v. 39 i. 12 p. 92 - 106
- Granule-oriented programmingby: Yinliang Zhao v. 39 i. 12 p. 107 - 118
- Languages of the futureby: Tim Sheard v. 39 i. 12 p. 119 - 132
- An abstract intermediate representation in compilation systemsby: Dai Guilan, Tian Jinlan, Zhang Suqing, Jiang Weidu v. 38 i. 2 p. 12 - 18
- Language integration in the common language runtimeby: Jennifer Hamilton v. 38 i. 2 p. 19 - 28
- Efficient formalism-only parsing of XML/HTML using the s-calculusby: Quinn Tyler Jackson v. 38 i. 2 p. 29 - 35
- The simplest heuristics may be the best in Java JIT compilersby: Jonathan L. Schilling v. 38 i. 2 p. 36 - 46
- Interactive mathematics textbooksby: Robert Sinclair v. 38 i. 2 p. 47 - 56
- Inverting back the inversion of control or, continuations versus page-centric programmingby: Christian Queinnec v. 38 i. 2 p. 57 - 64
- Everything is Fortran, in its own wayby: G. Alan Creak v. 38 i. 4 p. 7 - 12
- Evaluating Forth in the Windows environmentby: Paul Frenger v. 38 i. 4 p. 13 - 15
- Function inlining versus function cloningby: Dibyendu Das v. 38 i. 4 p. 18 - 24
- Experiences in building a compiler for an object-oriented languageby: José de Oliveira Guimarães v. 38 i. 4 p. 25 - 33
- Assessment of the Java programming language for use in high integrity systemsby: Jagun Kwon, Andy J. Wellings, Steve King v. 38 i. 4 p. 34 - 46
- A formal semantic definition of DEVILby: Lei Luo, Ming-Yuan Zhu, Qing-Li Zhang v. 38 i. 4 p. 47 - 56
- KGOL: a Knowledge Grid operating languageby: Hai Zhuge, Jie Liu v. 38 i. 4 p. 57 - 66
- A simple parallel systemby: Thomas W. Christopher v. 38 i. 6 p. 6 - 8
- Some deficiencies of C++ in teaching CS1 and CS2by: Achla Agarwal, Krishna Agarwal v. 38 i. 6 p. 9 - 13
- Influences on the design of exception handling: ACM SIGSOFT project on the impact of software engineering research on programming language designby: Barbara G. Ryder, Mary Lou Soffa v. 38 i. 6 p. 16 - 22
- Function inlining versus function cloningby: Dibyendu Das v. 38 i. 6 p. 23 - 29
- Translating EXPRESS language model into C language modelby: Yu ChunYan, Wu Minghui, Liu Nairuo, Yueting Zhuang, Yunhe Pan v. 38 i. 6 p. 30 - 39
- The reflective nitrO abstract machineby: Francisco Ortín Soler, Juan Manuel Cueva Lovelle, Ana Belén Martínez Prieto v. 38 i. 6 p. 40 - 49
- The paradigm of open C++by: Boris Sunik v. 38 i. 6 p. 50 - 59
- Automatic generation of device driversby: Qing-Li Zhang, Ming-Yuan Zhu, Shuo-Ying Chen v. 38 i. 6 p. 60 - 69
- Details on a simple parallel systemby: Thomas W. Christopher v. 38 i. 8 p. 12 - 14
- The JOY of forthby: Paul Frenger v. 38 i. 8 p. 15 - 17
- Formal definition of programming language standardsby: Cornelis Pronk, Martin Schönhacker v. 38 i. 8 p. 20 - 21
- Migration of enterprise JavaBeans with ProActive Interposition Objectsby: Baomin Xu, Weimin Lian, Qiang Gao v. 38 i. 8 p. 22 - 28
- Dynamically scoped functions as the essence of AOPby: Pascal Costanza v. 38 i. 8 p. 29 - 36
- Templates-based portable just-in-time compilerby: Alex Iliasov v. 38 i. 8 p. 37 - 43
- Object serialization analysis and comparison in Java and .NETby: Marjan Hericko, Matjaz B. Juric, Ivan Rozman, Simon Beloglavec, Ales Zivkovic v. 38 i. 8 p. 44 - 54
- XVF: C++ introspection by extensible visitationby: Kurt Stephens v. 38 i. 8 p. 55 - 59
- Value reuse optimization: reuse of evaluated math library function calls through compiler generated cacheby: K. V. Seshu Kumar v. 38 i. 8 p. 60 - 66
- Thank you, Sethby: Jay Fenwick, Cindy Norris v. 37 i. 2 p. 1 - 1
- Calendarv. 37 i. 2 p. 4 - 12
- Jump Tables and State Machinesby: Julian V. Noble v. 37 i. 2 p. 14 - 19
- What Should Be In a Parallel Libraryby: Thomas W. Christopher v. 37 i. 2 p. 20 - 22
- Programming lessons from days gone by: Backward ran sentences until reeled the mindby: G. Alan Creak v. 37 i. 2 p. 23 - 26
- Analysis and Detection of Computer Viruses and Worms: An Annotated Bibliographyby: Prabhat K. Singh, Arun Lakhotia v. 37 i. 2 p. 29 - 35
- Weaving Aspects in a Persistent Environmentby: Awais Rashid v. 37 i. 2 p. 36 - 44
- Objects for Lexical Analysisby: Bernd Kühl, Axel-Tobias Schreiner v. 37 i. 2 p. 45 - 52
- A Scripting Language to Help the Blind to Program Visuallyby: Robert M. Siegfried v. 37 i. 2 p. 53 - 56
- Efficient Concise Deterministic Pattern-Matching Automata for Ambiguous Patternsby: Nadia Nedjah, Luiza de Macedo Mourelle v. 37 i. 2 p. 57 - 67
- Bit Vector Encoding of N-Queen Problemby: Zongyan Qiu v. 37 i. 2 p. 68 - 70
- LATEX Support for Proceedingsby: Norman Ramsey v. 37 i. 4 p. 1 - 3
- Calendarv. 37 i. 4 p. 5 - 14
- Forth report: strap-on Forthby: Paul Frenger v. 37 i. 4 p. 17 - 20
- Programming lessons from days gone by: Cobol, stewed for studentsby: G. Alan Creak v. 37 i. 4 p. 21 - 26
- Communicating reactive objects: message-driven parallelismby: Thomas W. Christopher v. 37 i. 4 p. 27 - 28
- Pseudo object-oriented programming considered harmfulby: Conrad Weisert v. 37 i. 4 p. 31 - 31
- Write barrier removal by static analysisby: Karen Zee, Martin C. Rinard v. 37 i. 4 p. 32 - 41
- Efficient global register allocation for minimizing energy consumptionby: Yumin Zhang, Xiaobo Hu, Danny Z. Chen v. 37 i. 4 p. 42 - 53
- A modest proposal for curing the public field phobiaby: Diomidis Spinellis v. 37 i. 4 p. 54 - 56
- Smart proxies for Jini servicesby: Pascal Ledru v. 37 i. 4 p. 57 - 61
- Good design principles in a compiler university courseby: César F. Acebal, Raúl Izquierdo Castanedo, Juan Manuel Cueva Lovelle v. 37 i. 4 p. 62 - 73
- The HSSM macro-architecture, Virtual Machine and H languagesby: Paul Damian Wells v. 37 i. 4 p. 74 - 82
- Forth's DOOMby: Paul Frenger v. 37 i. 6 p. 14 - 17
- Understanding object-oriented programmingby: Joseph Bergin, Russel L. Winder v. 37 i. 6 p. 18 - 25
- Yet another meta-language for programming language processingby: Haiming Chen, Yunmei Dong v. 37 i. 6 p. 28 - 37
- Retargetable cross compilation techniques: comparison and analysis of GCC and Zephyrby: Dai Guilan, Tian Jinlan, Zhang Suqing, Jiang Weidu, Dai Jun v. 37 i. 6 p. 38 - 44
- A study of compiler techniques for multiple targets in compiler infrastructuresby: Dai Guilan, Zhang Suqing, Tian Jinlan, Jiang Weidu v. 37 i. 6 p. 45 - 51
- SXML specificationby: Oleg Kiselyov v. 37 i. 6 p. 52 - 58
- Vector Pascal reference manualby: W. Paul Cockshott v. 37 i. 6 p. 59 - 81
- Analysis of object interaction during the enterprise javabeans lifecycle using formal specification techniqueby: Ji-Hyun Lee, Cheol-Jung Yoo, Ok-Bae Chang v. 37 i. 6 p. 82 - 92
- Quartus forth for the palm pilotby: Paul Frenger v. 37 i. 8 p. 6 - 8
- Conflictsby: Chris Clark v. 37 i. 8 p. 9 - 14
- HPC is a strange landby: Thomas W. Christopher v. 37 i. 8 p. 15 - 16
- How many trivial getter methods does java have?by: Elliott Hughes v. 37 i. 8 p. 19 - 24
- Embedding built-in tests in hot spots of an object-oriented frameworkby: Taewoong Jeon, Hyonwoo Seung, Sungyoung Lee v. 37 i. 8 p. 25 - 34
- Implementing a real computational-environment jump in order to develop a runtime-adaptable reflective platformby: Francisco Ortín Soler, Juan Manuel Cueva Lovelle v. 37 i. 8 p. 35 - 44
- An overview of methods for dependence analysis of concurrent programsby: Zhenqiang Chen, Baowen Xu, Jianjun Zhao v. 37 i. 8 p. 45 - 52
- E-path_PRE: partial redundancy elimination made easyby: Dhananjay M. Dhamdhere v. 37 i. 8 p. 53 - 65
- Detection of information leak by data flow analysisby: Kyung-Goo Doh, Seung Cheol Shin v. 37 i. 8 p. 66 - 71
- Going APE.FORTH to marsby: Paul Frenger v. 37 i. 12 p. 9 - 13
- Edsger W. Dijkstraby: G. Alan Creak v. 37 i. 12 p. 14 - 16
- Introduction to special issueby: Cindy Norris v. 37 i. 12 p. 17 - 17
- Trace analysis of Erlang programsby: Thomas Arts, Lars-åke Fredlund v. 37 i. 12 p. 18 - 24
- World-class product certification using Erlangby: Ulf Wiger, Gösta Ask, Kent Boortz v. 37 i. 12 p. 25 - 34
- An embedded language approach to teaching hardware compilationby: Koen Claessen, Gordon J. Pace v. 37 i. 12 p. 35 - 46
- Testing monadic code with QuickCheckby: Koen Claessen, John Hughes v. 37 i. 12 p. 47 - 59
- Template meta-programming for Haskellby: Tim Sheard, Simon L. Peyton Jones v. 37 i. 12 p. 60 - 75
- Pattern-matching and rewriting rules for group indexed data structuresby: Jean-Louis Giavitto, Olivier Michel, Julien Cohen v. 37 i. 12 p. 76 - 87
- A rule-based language for programming software updatesby: Martin Erwig, Deling Ren v. 37 i. 12 p. 88 - 97
- Computer assisted manipulation of algebraic process specificationsby: Jan Friso Groote, Bert Lisser v. 37 i. 12 p. 98 - 107
- On-the-fly model checking from interval logic specificationsby: Miguel J. Hornos, Manuel I. Capel v. 37 i. 12 p. 108 - 119
- SIGPLAN Web Pages and Mailing Listby: Jack W. Davidson v. 36 i. 2 p. 1 - 2
- Call for Articles and Columns - SIGPLAN Notices Wants YOU!by: James B. Fenwick Jr., Cindy Norris v. 36 i. 2 p. 3 - 3
- Calendarv. 36 i. 2 p. 4 - 18
- Student Research Forum at PLDI'01by: Lori L. Pollock v. 36 i. 2 p. 19 - 19
- EXTREME Forthby: Paul Frenger v. 36 i. 2 p. 20 - 23
- A Neural Net Compiler System for Hierarchical Organizationby: Rajeev Kumar v. 36 i. 2 p. 26 - 36
- Definition of Open Languageby: Boris Sunik v. 36 i. 2 p. 37 - 46
- A Systematic Generation of Initial Register-Reuse Chains for Dependence Minimizationby: Yukong Zhang, Young-Jun Kwon, Hyuk-Jae Lee v. 36 i. 2 p. 47 - 54
- SIGPLANet - A Modest Proposal for SIGPLAN in the 21st Centuryby: Thomas Ball, Hans-Juergen Boehm v. 36 i. 4 p. 1 - 2
- SIGPLAN Response to the Ironman Draft of the Computing Curricula 2001by: Ron Cytron, Matthias Felleisen v. 36 i. 4 p. 3 - 4
- Calendarv. 36 i. 4 p. 5 - 20
- Close Encounters of the Forth Kindby: Paul Frenger v. 36 i. 4 p. 21 - 24
- Functional Programming in C++ using the FC++ Libraryby: Brian McNamara, Yannis Smaragdakis v. 36 i. 4 p. 25 - 30
- Slicing Object-Oriented Java Programsby: Zhengqiang Chen, Baowen Xu v. 36 i. 4 p. 33 - 40
- Slicing Concurrent Java Programsby: Zhengqiang Chen, Baowen Xu v. 36 i. 4 p. 41 - 47
- Some issues on the translator of Smalltalk to C++by: Wang Shaofeng, Fuqing Yang, Sun Jiaguang v. 36 i. 4 p. 48 - 55
- SIGPLAN's Professional Activities Committeeby: Kathleen Knobe, Wilson C. Hsieh, Ulrich Kremer v. 36 i. 6 p. 1 - 2
- Calendarv. 36 i. 6 p. 3 - 18
- The Undergraduate Language Course: What To Do?by: Joseph Bergin v. 36 i. 6 p. 20 - 22
- Is Forth Dead?by: Paul Frenger v. 36 i. 6 p. 23 - 25
- The Denotational Semantics of NIPLby: Tao Li, XiaoJie Liu v. 36 i. 6 p. 28 - 37
- From Pascal to Delphi to Object Pascal-2000by: Alexander Gofen v. 36 i. 6 p. 38 - 49
- Class-is-type is inadequate for object reuseby: Sheng Yu v. 36 i. 6 p. 50 - 59
- Letter from the Newly Elected Chairby: Hans-Juergen Boehm v. 36 i. 9 p. 1 - 2
- Letter from the LCTES Steering Committeeby: Dave Wahlley v. 36 i. 9 p. 3 - 3
- Calendarv. 36 i. 9 p. 4 - 16
- Functional Programming, and Where You Can Put Itby: Rex L. Page v. 36 i. 9 p. 19 - 24
- ASTs for Optimizing Compilersby: Chris Clark v. 36 i. 9 p. 25 - 30
- Test Programs to Observe Parallelismby: Thomas W. Christopher v. 36 i. 9 p. 31 - 36
- Denotational Semantics of Programming Languages and Compiler Generation in PowerEpsilonby: Ming-Yuan Zhu v. 36 i. 9 p. 39 - 53
- Formal Specification of Debuggersby: Ming-Yuan Zhu v. 36 i. 9 p. 54 - 63
- Using smgn for Rapid Prototyping of Small Domain-Specific Languagesby: Holger M. Kienle v. 36 i. 9 p. 64 - 73
- Smgn - some historical remarksby: David L. Moore v. 36 i. 9 p. 74 - 76
- About Code Layout for Lispby: Michael L. Gassanenko v. 36 i. 9 p. 77 - 80
- On Dart-Zobel Algorithm for Testing Regular Type Inclusionby: Lunjin Lu v. 36 i. 9 p. 81 - 85
- A Framework Design of Workflow Management System with Java RMIby: Wang Shaofeng, Sun Jiaguang v. 36 i. 9 p. 86 - 93
- Introduction to this issue's special section on Intriguing Technology from OOPSLAby: John M. Vlissides, Doug Lea v. 36 i. 12 p. 1 - 1
- Calendarv. 36 i. 12 p. 2 - 11
- Extreme Forthby: Paul Frenger v. 36 i. 12 p. 16 - 19
- Programming Dynamically Reconfigurable Open systems with SALSAby: Carlos A. Varela, Gul Agha v. 36 i. 12 p. 20 - 34
- TACO - Prototyping High-Level Object-Oriented Programming Constructs by Means of Template Based Programming Techniquesby: Jörg Nolte, Yutaka Ishikawa, Mitsuhisa Sato v. 36 i. 12 p. 35 - 49
- Architecture and Design of Adaptive Object Modelsby: Joseph W. Yoder, Federico Balaguer, Ralph E. Johnson v. 36 i. 12 p. 50 - 60
- Naked objects: a technique for designing more expressive systemsby: Richard Pawson, Robert Matthews v. 36 i. 12 p. 61 - 67
- Dependence Analysis for Recursive Java Programsby: Baowen Xu, Zhenqiang Chen v. 36 i. 12 p. 70 - 76
- Representing Change By Aspectby: Peter Dolog, Valentino Vranic, Mária Bieliková v. 36 i. 12 p. 77 - 83
- AspectCOOL: An experiment in design and implementation of aspect-oriented languageby: Enis Avdicausevic, Mitja Lenic, Marjan Mernik, Viljem Zumer v. 36 i. 12 p. 84 - 94
- PLDI '99: Programming Language Design and Implementation (Report)by: Barbara G. Ryder v. 35 i. 2 p. 9 - 9
- Uniform Abstract Syntax Treesby: Chris Clark v. 35 i. 2 p. 11 - 16
- The Ultimate RISC: A Zero-Instruction Computerby: Paul Frenger v. 35 i. 2 p. 17 - 23
- Java will be faster than C++by: Kirk Reinholtz v. 35 i. 2 p. 25 - 28
- An Object Oriented Approach to Constructing Recursive Descent Parsersby: Matthew S. Davis v. 35 i. 2 p. 29 - 35
- Sources in Software Pipelining Loops with Conditions Branchesby: Dragan Milicev, Zoran Jovanovic v. 35 i. 2 p. 36 - 45
- Adapters and Binders - Overcoming Problems in the Design and Implementation of the C++-STLby: Volker Simonis v. 35 i. 2 p. 46 - 53
- Codebugger - A Software Tools for Cooperative Debuggingby: Gaoyan Xie, YongSen Xu, Yu Li, Qian Li v. 35 i. 2 p. 54 - 60
- Object-Oriented Programming with Inductionby: Bing Swen v. 35 i. 2 p. 61 - 67
- 1999 SIGPLAN Awardsby: Mary Lou Soffa v. 35 i. 3 p. 2 - 3
- Calendarby: Seth Bergmann v. 35 i. 3 p. 4 - 15
- PADL '00: Workshop on Practical Aspects of Declarative Languagesby: Enrico Pontelli, Vítor Santos Costa v. 35 i. 3 p. 16 - 17
- JICC4: Java in the Computing Curriculaby: Peter Chalk v. 35 i. 3 p. 18 - 19
- Servlets - Web-Based Applications You Can Live Withby: Brent W. Benson Jr. v. 35 i. 3 p. 21 - 24
- Learning Forth with Modular Forthby: Paul Frenger v. 35 i. 3 p. 25 - 30
- History of Programming Languages and Software Engineering - A Web-Based Toolby: Tim Bergin v. 35 i. 3 p. 31 - 31
- Compilers and Interpreters Archiveby: David A. Padua, Ron Cytron v. 35 i. 3 p. 32 - 32
- The Security Problem of Nested Classesby: Yu Li, Gaoyan Xie, YongSen Xu, Yi Yang v. 35 i. 3 p. 34 - 38
- Semantics of Programming Languages: A Tool-Oriented Approachby: Jan Heering, Paul Klint v. 35 i. 3 p. 39 - 48
- Efficient Message Dispatch in Object-Oriented Systemsby: Mayur Naik, Rajeev Kumar v. 35 i. 3 p. 49 - 58
- Ranking the Complexity of NIAM Conceptual Schemas by Alpha Metricby: Peter Kokol, Vili Podgorelec, Henri Habrias, Nassim Hadj Rabia v. 35 i. 3 p. 59 - 64
- An Intelligent Neural Network Programming System (NNPS)by: Tao Li, XiaoJie Liu v. 35 i. 3 p. 65 - 72
- The 1999 ICFP Programming Contestby: Norman Ramsey, Kevin Scott v. 35 i. 3 p. 73 - 83
- Welcome ever smiles / And farewell goes out sighingby: A. Michael Berman v. 35 i. 4 p. 1 - 1
- Calendarby: Seth Bergmann v. 35 i. 4 p. 3 - 16
- Newlines and Lexer Statesby: Chris Clark v. 35 i. 4 p. 18 - 24
- Curriculum 2001 Draft Found Lacking in Programming Languagesby: Kim B. Bruce v. 35 i. 4 p. 26 - 28
- Propoosed Knowledge Units for Programming Languages for Curriculum 2001v. 35 i. 4 p. 29 - 43
- A Small Hybrid JIT for Embedded Systemsby: Geetha Manjunath, Venkatesh Krishnan v. 35 i. 4 p. 44 - 50
- A Hybrid State Machine for Component Specificationby: Alexander Sakharov v. 35 i. 4 p. 51 - 56
- Letter from the Chairby: Ron Cytron v. 35 i. 6 p. 1 - 1
- Calendarby: Seth Bergmann v. 35 i. 6 p. 2 - 14
- Off-And-On Tokensby: Chris Clark v. 35 i. 6 p. 15 - 20
- The GOTO Machineby: Paul Frenger v. 35 i. 6 p. 21 - 24
- Domain-Specific Languages: An Annotated Bibliographyby: Arie van Deursen, Paul Klint, Joost Visser v. 35 i. 6 p. 26 - 36
- Effective Parameterization of Architectural Registers for Register Allocation Alogorithmsby: Y. N. Srikant, D. V. Ravindra v. 35 i. 6 p. 37 - 46
- Lazy Lists in C++by: Sibylle Schupp v. 35 i. 6 p. 47 - 54
- SIGPLAN Awardsby: Ron Cytron v. 35 i. 8 p. 1 - 2
- Calendarby: Seth Bergmann v. 35 i. 8 p. 3 - 14
- Forth and the FreeBSD Bootloaderby: Paul Frenger v. 35 i. 8 p. 15 - 17
- uu for Programming Languagesby: Ulisses Ferreira v. 35 i. 8 p. 20 - 30
- Java 2 Distributed Object Middleware Performance Analysis and Optimizationby: Matjaz B. Juric, Ivan Rozman, Simon Nash v. 35 i. 8 p. 31 - 40
- Calendarby: Seth Bergmann v. 35 i. 12 p. 1 - 12
- Java Server Pages - Servlets, Inside Outby: Brent W. Benson Jr. v. 35 i. 12 p. 14 - 18
- Forth in the UKby: Chris Jakeman v. 35 i. 12 p. 19 - 21
- A Multiparty Coordination Aspect Languageby: Rafael Corchuelo, José Antonio Pérez, Miguel Toro v. 35 i. 12 p. 24 - 32
- An object-oriented LL(1) parser generatorby: Bernd Kühl, Axel-Tobias Schreiner v. 35 i. 12 p. 33 - 40
- Improving the quality of compiler construction with object-oriented techniquesby: David Basanta Gutiérrez, María Cándida Luengo Díez, Raúl Izquierdo Castanedo, José Emilio Labra Gayo, Juan Manuel Cueva Lovelle v. 35 i. 12 p. 41 - 50
- Multiparadigm Design of a Simple Relational Databaseby: Charles D. Knutson, Timothy A. Budd, Hugh Vidos v. 35 i. 12 p. 51 - 61
- A Correction and Apologyby: A. Michael Berman v. 34 i. 2 p. 1 - 1
- Panel Sessions at SIGPLAN Conferencesby: Michael G. Burke v. 34 i. 2 p. 2 - 3
- EAPLS: the European Association for Programming Languages and Systemsby: Neil D. Jones v. 34 i. 2 p. 19 - 20
- Paths between Imperative and Functional Programmingby: Thomas Ball v. 34 i. 2 p. 21 - 25
- What to Do with a Dangling Elseby: Chris Clark v. 34 i. 2 p. 26 - 31
- Inner Classes: Closures for the Massesby: Brent W. Benson Jr. v. 34 i. 2 p. 32 - 35
- Forth and the Open Terminal Architectureby: Paul Frenger v. 34 i. 2 p. 36 - 39
- Declarative Peephole Optimization Using String Pattern Matchingby: Diomidis Spinellis v. 34 i. 2 p. 47 - 51
- A Type System of Logic Objectsby: Dianxiang Xu v. 34 i. 2 p. 52 - 56
- Corporate Support and SIGPLANby: Benjamin G. Zorn v. 34 i. 4 p. 1 - 2
- Build a Tree - Save a Parseby: Chris Clark v. 34 i. 4 p. 19 - 24
- JavaScript - Not Java (but just as hot)by: Brent W. Benson Jr. v. 34 i. 4 p. 25 - 27
- Parallel Forthby: Paul Frenger v. 34 i. 4 p. 28 - 32
- Announcing the Mozart Programming Systemby: Peter Van Roy v. 34 i. 4 p. 33 - 34
- Microsoft and Yale Conclude Agreement to License Technology for Haskellby: John Peterson v. 34 i. 4 p. 35 - 36
- Java's Insecure Parallelismby: Per Brinch Hansen v. 34 i. 4 p. 38 - 45
- Early Storage Reclamation in a Tracing Garbage Collectorby: Timothy Harris v. 34 i. 4 p. 46 - 53
- Calculating Encoding and Decoding Functions for Prefix Codesby: Cristóbal Pareja-Flores, J. Ángel Velázquez-Iturbide v. 34 i. 4 p. 54 - 60
- Reverse Execution of Programsby: Bitan Biswas, Rajib Mall v. 34 i. 4 p. 61 - 69
- A Novel Program Representation for Interprocedural Analysisby: Gagan Agrawal, Shyamala Murthy, Chandrashekar Garud v. 34 i. 4 p. 70 - 76
- ETAPS '99 - Conference Reportby: Yanhong A. Liu, Scott D. Stoller v. 34 i. 6 p. 16 - 17
- Keywords: Scanners and Screenersby: Chris Clark v. 34 i. 6 p. 18 - 22
- Keep it Clean: A Unique Approach to Functional Programmingby: Marinus J. Plasmeijer, Marko C. J. D. van Eekelen v. 34 i. 6 p. 23 - 31
- Ficl, FORML & Object Forthby: John Sadler v. 34 i. 6 p. 32 - 35
- On the Return Types of Virtual Functionsby: Emanuele Panizzi, Bernardo Pastorelli v. 34 i. 6 p. 37 - 42
- Partial Redundancy Elimination is not Bidirectionalby: Michael Wolfe v. 34 i. 6 p. 43 - 46
- Bidirectional Data Flow Analysis: Myth and Realityby: Uday P. Khedker, Dhananjay M. Dhamdhere v. 34 i. 6 p. 47 - 57
- Object-Oriented Symbol Management in Syntax-Directed Compiler Systemsby: Mayur Naik, Rajeev Kumar v. 34 i. 6 p. 58 - 67
- Implementation of Multiple Attribute Grammar Inheritance in the Tool LISAby: Marjan Mernik, Viljem Zumer, Mitja Lenic, Enis Avdicausevic v. 34 i. 6 p. 68 - 75
- Integration of the Standard Template Library and the Microsoft Foundation Classby: Paul Wolfgang, Yang Song v. 34 i. 6 p. 76 - 81
- On the Application of a Popular Notation to Semanticsby: Richard J. Botting v. 34 i. 6 p. 82 - 83
- The Complexity of Formal Specifications - Assessments by alpha-Metricby: Peter Kokol, Vili Podgorelec, Henri Habrias, Nassim Hadj Rabia v. 34 i. 6 p. 84 - 88
- Letter from the Newly Elected Chairby: Ron Cytron v. 34 i. 12 p. 1 - 1
- Java in the Computing Curriculaby: Peter Chalk v. 34 i. 12 p. 9 - 11
- SIGAda '98: ACM/SIGAda International Conference (Report)by: Michael Hind v. 34 i. 12 p. 12 - 12
- BlurFit - an Application of Functional Programming to Scientific Analysisby: D. McClain v. 34 i. 12 p. 13 - 17
- Keywords: Special Identifier Idiomby: Chris Clark v. 34 i. 12 p. 18 - 23
- Forttran Information Fileby: Michael Metcalf v. 34 i. 12 p. 24 - 29
- Firmware Factory & Forthby: Brad Eckert v. 34 i. 12 p. 30 - 33
- Comment on ``On the Application of a Popular Notation to Semantics'' and reply from the Autorby: Oleg Kiselyov, Richard J. Botting v. 34 i. 12 p. 35 - 36
- Programming World Wide Web Pages in Schemeby: Kurt Nørmark v. 34 i. 12 p. 37 - 46
- An Ada-based Object-Oriented Modeling Languageby: Guilan Dai, Baowen Xu v. 34 i. 12 p. 47 - 56
- SEIS++: A Pattern Language for Seismic Tools Construction and Integrationby: Li Yingjun, Lu Jian v. 34 i. 12 p. 57 - 66
- A Comparison of Real/time Object-Oriented Modeling Methods ROOM and OCTOPUSby: Guilan Dai, Baowen Xu v. 34 i. 12 p. 67 - 71
- SIGPLAN and the World Seriesby: Fritz Henglein v. 33 i. 1 p. 1 - 2
- Report of the IFIP Technical Committee on Software TC-2 Meetingby: Roger K. DeBry v. 33 i. 1 p. 15 - 21
- Iterators Evaluate Table Queries (C++ Toolbox)by: Dieter Gluche, Dietmar Kühl, Karsten Weihe v. 33 i. 1 p. 22 - 29
- You Could Learn a Lot from a Quadratic: I. Overloading Considered Harmfulby: Henry G. Baker v. 33 i. 1 p. 30 - 38
- Minimal Deterministic Left-to-Right Pattern-Matching Automataby: Nadia Nedjah v. 33 i. 1 p. 40 - 47
- Expressing Opposition in the Object Model, First Step towards Negationby: Nicolas Anquetil, Jean G. Vaucher v. 33 i. 1 p. 48 - 55
- Unloading Java Classes That Contain Static Fieldsby: Charles E. McDowell, Elizabeth A. Baldwin v. 33 i. 1 p. 56 - 60
- SPLAW: A Computable Language for Agent-oriented Programmingby: Xiaocong Fan, Dianxiang Xu, Hou Jianmin, Guoliang Zheng v. 33 i. 1 p. 61 - 69
- Executive Commitee News: SIGPLAN Conferencesby: Robert R. Kessler v. 33 i. 2 p. 1 - 1
- Parallelism and Implementation Technology for (Constraint) Logic Programmingby: Enrico Pontelli v. 33 i. 2 p. 15 - 17
- COST: Common Object Support Toolkit (C++ Toolbox)by: Cass W. Everitt, John van der Zwaag, Robert J. Moorhead v. 33 i. 2 p. 18 - 24
- An Angry Half-Dozenby: Philip Wadler v. 33 i. 2 p. 25 - 30
- Observations on the EuroForth '97 Conferenceby: Paul Frenger v. 33 i. 2 p. 31 - 33
- You Could Learn a Lot from a Quadratic: II. Digital Dentistryby: Henry G. Baker v. 33 i. 2 p. 34 - 39
- Learning Programming in Prolog Using Schemataby: Mária Bieliková, Pavol Návrat v. 33 i. 2 p. 41 - 47
- A Formal Approach to the Teaching of Programming Language Conceptsby: Andrew Kitchen v. 33 i. 2 p. 48 - 55
- 64 Bit Oberonby: Günter Dotzel, Hartmut Goebel v. 33 i. 2 p. 56 - 58
- Whene are Two Classes Equivalent?by: K. Rangarajan, A. Balasubramaniam v. 33 i. 2 p. 59 - 64
- Comments On Several Syntax Rules in Ada95by: Baowen Xu v. 33 i. 2 p. 65 - 67
- SIGPLAN Supports Your Professional Activitiesby: Peter Lee v. 33 i. 3 p. 1 - 1
- Languages of the Net (Historial Notes)by: Peter H. Salus v. 33 i. 3 p. 16 - 20
- The Growing Machine, a Pre-Forth Language Implementationby: Paul Frenger v. 33 i. 3 p. 21 - 23
- March Möbius Madness with a Polynomial PostScript, March 32, 1998by: Henry G. Baker v. 33 i. 3 p. 24 - 35
- A Modular Mathematical Programming Languageby: Ronald E. Prather v. 33 i. 3 p. 38 - 56
- An Evaluation of High Performance Fortranby: Per Brinch Hansen v. 33 i. 3 p. 57 - 64
- An Evaluation of The Message-Passing Interfaceby: Per Brinch Hansen v. 33 i. 3 p. 65 - 72
- J - Set of Tools for Native Code Generation for the Java Virtual Machineby: Oscar Azañón Esteire, Juan Manuel Cueva Lovelle v. 33 i. 3 p. 73 - 79
- ISO Committee Document for C9X and Public Comment Period - The C Programming Languageby: Rex Jaeschke v. 33 i. 4 p. 16 - 16
- SSA is Functional Programmingby: Andrew W. Appel v. 33 i. 4 p. 17 - 20
- The Talking Toasterby: Paul Frenger v. 33 i. 4 p. 21 - 25
- Garbage: Two New Structuresby: G. Alan Creak v. 33 i. 4 p. 28 - 29
- Editorial - Justifying Java?by: Fintan Culwin v. 33 i. 4 p. 31 - 33
- Java, the Good, the Bad and the Uglyby: Peter Martin v. 33 i. 4 p. 34 - 39
- Structured Programing in Javaby: Jeremy Gibbons v. 33 i. 4 p. 40 - 43
- Using CORBA and JDBC to Produce Three Tier Systemsby: Barry Cornelius v. 33 i. 4 p. 44 - 52
- Kinds Of Language, Kinds Of Learningby: Peter Burton v. 33 i. 4 p. 53 - 61
- SIGPLAN Notices - Where We Are, Wher We're Goingby: A. Michael Berman v. 33 i. 6 p. 1 - 2
- MASPLAS '98 - Conference Reportby: Barbara G. Ryder v. 33 i. 6 p. 16 - 16
- The DrScheme Project: An Overviewby: Matthias Felleisen, Robert Bruce Findler, Matthew Flatt, Shriram Krishnamurthi v. 33 i. 6 p. 17 - 23
- Forth in Space, or, So NEAR Yet So Far Outby: Paul Frenger v. 33 i. 6 p. 24 - 26
- You Could Learn a Lot from a Quadratic: Newton Squares the Circleby: Henry G. Baker v. 33 i. 6 p. 27 - 31
- Fractal Structure of Random Programsby: Peter Kokol, Janez Brest v. 33 i. 6 p. 33 - 38
- Design of an Actor Language for Implicit Parallel Programmingby: Yariv Aridor, Shimon Cohen, Amiram Yehudai v. 33 i. 6 p. 39 - 47
- Understanding Class Evolution Through Atomic Changesby: K. Rangarajan, P. Eswar v. 33 i. 6 p. 48 - 53
- APL Extended Compared With Other Languages According to Halstead's Theoryby: F. H. D. van Batenburg, Ellen de Ridder, Joseph de Kerf v. 33 i. 6 p. 54 - 60
- Static Header as Sentinelby: Massimo Ancona, Walter Cazzola v. 33 i. 6 p. 61 - 64
- An Invitation to OOPSLA '98by: Benjamin G. Zorn v. 33 i. 8 p. 1 - 3
- Programming with {SETS} - An International Forum of Discussionby: Enrico Pontelli v. 33 i. 8 p. 16 - 16
- Developing a Tool for Memoizing Functions in C++ (C++ Toolbox)by: Paul McNamee, Marty Hall v. 33 i. 8 p. 17 - 22
- Why No One Uses Functional Languagesby: Philip Wadler v. 33 i. 8 p. 23 - 27
- A Tribute to FIG-Forthby: Paul Frenger v. 33 i. 8 p. 28 - 31
- Per Brinch Hansen's Concerns about High Performance Fortranby: Carl D. Offner v. 33 i. 8 p. 34 - 39
- Optimizing Away C++ Exception Handlingby: Jonathan L. Schilling v. 33 i. 8 p. 40 - 47
- JSpace: Implementation of a Linda System in Javaby: Pascal Ledru v. 33 i. 8 p. 48 - 50
- A Traveling Saleman in Javaby: Pascal Ledru v. 33 i. 8 p. 51 - 56
- 1998 SIGPLAN Awardsby: Mary Lou Soffa v. 33 i. 9 p. 1 - 3
- ETAPS'98 Trip Reportby: William L. Scherlis v. 33 i. 9 p. 18 - 19
- MUCKing Around With Forthby: Paul Frenger v. 33 i. 9 p. 20 - 24
- Revised5 Report on the Algorithmic Language Schemeby: Richard Kelsey, William D. Clinger, Jonathan Rees v. 33 i. 9 p. 26 - 76
- Putting More Meaning in Expressionsby: Boyko B. Bantchev v. 33 i. 9 p. 77 - 83
- Reducing Garbage in Javaby: Charles E. McDowell v. 33 i. 9 p. 84 - 86
- rdp - An Iterator-Based Recursive Descent Parser Generator with Tree Promotion Operatorsby: Adrian Johnstone, Elizabeth Scott v. 33 i. 9 p. 87 - 94
- Experiences in Building c++ Front Endby: Fuqing Yang, Hong Mei, Wanghong Yuan, Qiong Wu, Yao Guo v. 33 i. 9 p. 95 - 102
- Floating Point Performance of Common Lispby: Christopher J. Vogt v. 33 i. 9 p. 103 - 107
- The Design and Implementation of the GILENA Natural Language Interface Specification Systemby: John A. Atkinson-Abutridy, Anita A. Ferreira-Cabrera v. 33 i. 9 p. 108 - 117
- SIGPLAN and SIGSOFT Joint Effortsby: Mary Lou Soffa, David Notkin v. 33 i. 12 p. 1 - 1
- Eat Your Own Dog Foodby: Brent W. Benson Jr. v. 33 i. 12 p. 16 - 19
- Overlapping Token Definitionsby: Chris Clark v. 33 i. 12 p. 20 - 24
- Mind.Forth: Thoughts on Artificail Intelligence and Forthby: Paul Frenger v. 33 i. 12 p. 25 - 31
- Letter: Processing Recursive Data Types in Javaby: Alexander Sakharov v. 33 i. 12 p. 33 - 33
- Index in BNF Grammars (Short Comment)by: Kurt Svensson v. 33 i. 12 p. 34 - 34
- A Simple Algorithm for Partial Redundancy Eliminationby: Vineeth Kumar Paleri, Y. N. Srikant, Priti Shankar v. 33 i. 12 p. 35 - 43
- ASAP - A Simple Assertion Pre-processorby: Igor D. D. Curcio v. 33 i. 12 p. 44 - 51
- Literate Programming and the "Spaniel" Methodby: Nick Hatzigeorgiu, Apostolos Syropoulos v. 33 i. 12 p. 52 - 56
- Java and Distributed Object Models: An Analysisby: Marjan Hericko, Matjaz B. Juric, Ales Zivkovic, Ivan Rozman, Tomaz Domajnko, Marjan Krisper v. 33 i. 12 p. 57 - 65
- Functional Programming and the Fragile Base Class Problemby: Timothy A. Budd v. 33 i. 12 p. 66 - 71
- Evolution of the High Level Programming Languages: A Critical Perspectiveby: Masud Ahmad Malik v. 33 i. 12 p. 72 - 80
- EQL - The Query Language You Never Heard Ofby: Charles D. Havener v. 33 i. 12 p. 81 - 88
- Programming Languages: Past, Present, and Futureby: Peter Trott v. 32 i. 1 p. 14 - 57
- Position Statements on Strategic Directions for Research on Programming Languagesby: Chris Hankin, Hanne Riis Nielson, Jens Palsberg v. 32 i. 1 p. 59 - 65
- Global Computationby: Luca Cardelli v. 32 i. 1 p. 66 - 68
- Program Adaption based on Program Transformationby: Charles Consel v. 32 i. 1 p. 69 - 72
- Program Analysis: The Abstract Interpretation Perspectiveby: Patrick Cousot v. 32 i. 1 p. 73 - 76
- Integration of Declarative Paradigms: Benefits and Challengesby: Michael Hanus v. 32 i. 1 p. 77 - 79
- ML and Beyondby: Robert Harper, John C. Mitchell v. 32 i. 1 p. 80 - 85
- Program Analysis for Software Engineering: New Applications, New Requirements, New Toolsby: Daniel Le Métayer v. 32 i. 1 p. 86 - 88
- Perspectives on Program Analysisby: Flemming Nielson v. 32 i. 1 p. 89 - 91
- Challenges in Type Systems Researchby: Martin Odersky v. 32 i. 1 p. 92 - 93
- Future Directions In Program Transformationsby: Robert Paige v. 32 i. 1 p. 94 - 97
- Future Directions in Program Transformationby: Alberto Pettorossi, Maurizio Proietti v. 32 i. 1 p. 99 - 102
- Beyond MLby: John C. Reynolds v. 32 i. 1 p. 103 - 105
- Program Language Semantics: The Description of Computational Structuresby: Jon G. Riecke v. 32 i. 1 p. 106 - 109
- A Position Paper on Compile-time Program Analysisby: Barbara G. Ryder v. 32 i. 1 p. 110 - 114
- On the Need for a Popular Formal Semanticsby: David A. Schmidt v. 32 i. 1 p. 115 - 116
- Provably-Secure Programming Languages for Remote Evaluationby: Dennis M. Volpano v. 32 i. 1 p. 117 - 119
- Program Analysis: A Toolmaker's Perspectiveby: Reinhard Wilhelm v. 32 i. 1 p. 120 - 121
- An Object Oriented Framework for Creating Models in Hydrologyby: Knut Alfredsen, Bjørn Sæther v. 32 i. 2 p. 16 - 19
- Book Nook: Compiler Contruction by Niklaus Wirthby: Ron Cytron v. 32 i. 2 p. 20 - 21
- An Introduction to the Beetle Forth Virtual Processorby: Reuben R. Thomas v. 32 i. 2 p. 22 - 25
- The Design and Implementation of a Program Development System Based on Rewriting Methodby: Yongqiang Sun, Kai Lin, Li Shen v. 32 i. 2 p. 27 - 34
- On Dimishing the Vibrant Confusion In Software Metricsby: Lem O. Ejiogu v. 32 i. 2 p. 35 - 38
- Conservative Pretty Printingby: Martin Ruckert v. 32 i. 2 p. 39 - 44
- Software Portability Annotated Bibliographyby: G. Deshpande, T. Troy Pearse, Paul W. Oman v. 32 i. 2 p. 45 - 53
- Re-engineering Needs Generic Programming Language Technologyby: Mark van den Brand, Paul Klint, Chris Verhoef v. 32 i. 2 p. 54 - 61
- C++ for Scientific Applications of Iterative Natureby: Tom Houlder v. 32 i. 3 p. 21 - 26
- When Bad Programs Happen to Good Peopleby: Henry G. Baker v. 32 i. 3 p. 27 - 31
- "Who Cares About Elegance?" The Role of Aesthetics in Programming Language Designby: Bruce J. MacLennan v. 32 i. 3 p. 33 - 37
- Proving Assertions is Also Usefulby: Jürgen F. H. Winkler, Stefan Kauer v. 32 i. 3 p. 38 - 41
- An Intelligent Backtracking Schema in A Logic Programming Environmentby: Ilyas Cicekli v. 32 i. 3 p. 42 - 49
- NDC++: An Approach to Concurrent Extension of C++by: Chen Jiajun, Guoliang Zheng v. 32 i. 3 p. 50 - 56
- On the Need for Predictable Floating-Point Arithmetic in the Programming Languages Fortran 90 and C/C++by: Dennis Verschaeren, Annie A. M. Cuyt, Brigitte Verdonk v. 32 i. 3 p. 57 - 64
- IEEE Efforts Towards Standards in Educational Technologyby: Roy Rada, James Schoening v. 32 i. 4 p. 16 - 18
- Predicting the Performance of Parallel Machinesby: Preston Briggs v. 32 i. 4 p. 19 - 21
- I Have a Feeling We're Not in Emerald City Anymoreby: Henry G. Baker v. 32 i. 4 p. 22 - 26
- Robot Control Techniques, Part One: A Review of Robotics Languagesby: Paul Frenger v. 32 i. 4 p. 27 - 31
- Monitoring Remote Sensing Devices in C++by: James P. Kelleghan v. 32 i. 4 p. 32 - 35
- A Note on Before and After Metamethodsby: Chris Zimmermann v. 32 i. 4 p. 37 - 46
- Block Structured Object Programmingby: Charles Rapin v. 32 i. 4 p. 47 - 54
- Implementation of a Database Factory (C++ Toolbox)by: Asokan R. Selvaraj, Debasish Ghosh v. 32 i. 6 p. 14 - 18
- Robot Control Techniques, Part Two: Forth as a Robotics Languagsby: Paul Frenger v. 32 i. 6 p. 19 - 22
- COMFY - A Comfortable Set of Control Primitives for Machine Language Programmingby: Henry G. Baker v. 32 i. 6 p. 23 - 27
- A Report on the 'Java in the Computing Curriculum Conference' held at South Bank University, London, on 4th February 1997by: Fintan Culwin v. 32 i. 6 p. 28 - 32
- Considerations in Developing a Formally-Based Visual Programming Language Reference Manual: A Case Study on the SLAM II Languageby: Debbie K. Carter, Albert D. Baker v. 32 i. 6 p. 34 - 39
- Computational Steering Annoted Bibliographyby: Jeffrey S. Vetter v. 32 i. 6 p. 40 - 44
- A Functional Approach to Type Constraints of Generic Definitionsby: Myung Ho Kim v. 32 i. 6 p. 45 - 52
- Garment: A Mechanism for Abstraction and Encapsulation of Languagesby: Naixiao Zhang, Zheng Hongjun, Zongyan Qiu v. 32 i. 6 p. 53 - 60
- Consummating Virtuality to Support More Polymorphism in C++by: Wen-Ke Chen, Jia-Su Sun, Zhi-Min Tang v. 32 i. 6 p. 61 - 68
- The F Programming Languageby: Ralph Frisbie, Richard Hendrickson, Michael Metcalf v. 32 i. 6 p. 69 - 74
- How to Achieve Modularity in Distributed Object Allocationby: Franco Zambonelli v. 32 i. 6 p. 75 - 82
- HOPL-II - Closing Panel: The History of Programming: Does our Present Past Have a Future?by: Thomas J. Bergin v. 32 i. 9 p. 15 - 37
- Making C++ Concurrent and Real-timeby: Wei Li, Gansheng Li v. 32 i. 9 p. 39 - 46
- Prolog: An Annotated Bibliographyby: Fatma Z. Mansouri, Colin A. Higgins v. 32 i. 9 p. 47 - 53
- Basic Foreverby: Rommert J. Casimir v. 32 i. 9 p. 54 - 56
- A Method for Modifying Dynamically Classes in the Object-Oriented Dynamic Programming Environmentby: Lu Pei, Dachuan Yu, Jian Lu v. 32 i. 9 p. 57 - 60
- Message Conversion and A New Type System for OO Modelby: Jianhua Zhao, Chen Jiajun, Guoliang Zheng v. 32 i. 9 p. 61 - 67
- Static Head Nodes in the Operations on Dynamic Structures - An useful programming techniqueby: Zongyan Qiu v. 32 i. 9 p. 68 - 71
- The 3rd ACM SIGPLAN Workshop on Languages, Compilers, and Tools for Real-Time Systems (Workshop Report)by: Frank Mueller v. 32 i. 11 p. 15 - 16
- Point-Extent Pattern for Dimensional Numeric Classes (C++ Toolbox)by: Conrad Weisert v. 32 i. 11 p. 17 - 20
- Venturing Forth With a Flashliteby: Paul Frenger v. 32 i. 11 p. 21 - 24
- The COMFY 6502 Compilerby: Henry G. Baker v. 32 i. 11 p. 25 - 30
- The Search for Simplicity - Essays in Parallel Programming by Per Brinch Hansenby: H. S. M. Kruijer v. 32 i. 11 p. 31 - 32
- Standardized Extensions to Modula-2by: Cornelis Pronk, Martin Schönhacker, Richard J. Sutcliffe, A. Wiedemann v. 32 i. 11 p. 34 - 48
- Web Pages that Reproduce Themselves by JavaScriptby: Yasusi Kanada v. 32 i. 11 p. 49 - 56
- Design and Static Semantics of Algorithm Language Lby: Zhang Jiazhong, Wang Yanbing, Zheng Mingchun v. 32 i. 11 p. 57 - 64
- Patterns, Architecture and Softwareby: Richard Helm v. 31 i. 1 p. 2 - 3
- Rememberingby: Preston Briggs v. 31 i. 1 p. 4 - 5
- A New Resource for C++ Programmers and an Invitation for Participationby: G. Bowden Wise v. 31 i. 1 p. 6 - 8
- Starting Pointsby: Kate Stewart v. 31 i. 1 p. 9 - 11
- Tail-Recursive Parallel Summing of a Multi-Listby: Chung-Kwong Yuen, Ming-Dong Feng v. 31 i. 1 p. 20 - 21
- DDD - A Free Graphical Front-End for UNIX Debuggersby: Andreas Zeller, Dorothea Lütkehaus v. 31 i. 1 p. 22 - 27
- Bottom-up Tree Rewriting Tool MBURGby: K. John Gough v. 31 i. 1 p. 28 - 31
- A Note on Covariance and Contravariance Unificationby: Myles F. Barrett, Marshall E. Giguere v. 31 i. 1 p. 32 - 35
- A Model for Implementing an Object-Oriented Design without Language Extensionsby: Jennifer Hamilton v. 31 i. 1 p. 36 - 43
- Towards a Classification of Visibility Rulesby: Michael A. Klug v. 31 i. 1 p. 44 - 50
- Column Constructorby: A. Michael Berman v. 31 i. 2 p. 4 - 5
- Describing Biological Cells by Computer Programsby: Pankaj Agarwal v. 31 i. 2 p. 6 - 7
- The Third International Conference on Parallel Computing Technologies (PaCT-95), Saint Petersburg, Russiaby: Gabriel M. Silberman v. 31 i. 2 p. 8 - 9
- mpC: a Multi-Paradigm Programming Language for Massively Parallel Computersby: Alexey L. Lastovetsky v. 31 i. 2 p. 13 - 20
- Translating SQL for Database Reengineeringby: Antti-Pekka Tuovinen, Jukka Paakki v. 31 i. 2 p. 21 - 26
- LL and LR Translators Need k>1 Lookaheadby: Terence J. Parr, Russell W. Quong v. 31 i. 2 p. 27 - 34
- Software Complexity - An Alternative Viewby: Peter Kokol, Janez Brest, Viljem Zumer v. 31 i. 2 p. 35 - 41
- A Conceptual Perspective on the Comparison of Object-Oriented Programming Languagesby: Bent Bruun Kristensen, Kasper Østerbye v. 31 i. 2 p. 42 - 54
- Intensional Equality ;=) for Continuationsby: Andrew W. Appel v. 31 i. 2 p. 55 - 57
- Philadelphia Dreamingby: A. Michael Berman v. 31 i. 3 p. 2 - 3
- Do Programmers Need Seat Belts?by: Daniel M. Yellin, Robert E. Strom, Richard P. Gabiel v. 31 i. 3 p. 5 - 10
- Fair Transition System Specification: An Integrated Approachby: Guoping Jia, Guoliang Zheng v. 31 i. 3 p. 14 - 21
- PL/I for OS/2by: Robin A. Vowels v. 31 i. 3 p. 22 - 27
- A New Sort Algorithm: Self-Indexed Sortby: Sunny Y. Wang v. 31 i. 3 p. 28 - 36
- On Beyond OOPby: A. Michael Berman v. 31 i. 4 p. 1 - 3
- An Overview of the Standard Template Libraryby: G. Bowden Wise v. 31 i. 4 p. 4 - 10
- Automatic Parallelizationby: Preston Briggs v. 31 i. 4 p. 11 - 15
- WRAPGEN - A Tool for the Use of Fortran and C Together in Portable Programsby: Robert E. Bruccoleri v. 31 i. 4 p. 20 - 27
- A Translator from C to a Lambda-Calculus Representationby: Michael Karr v. 31 i. 4 p. 28 - 31
- Annealing and Data Decomposition in VDM++by: S. J. Goldsack, Kevin Lano, Eugène Dürr v. 31 i. 4 p. 32 - 38
- A Survey of Object Oriented Forthsby: Bradford J. Rodriguez, W. F. S. Poehlman v. 31 i. 4 p. 39 - 42
- Toward an Object-Oriented Forthby: Leonard Zettel v. 31 i. 4 p. 43 - 44
- Object-Oriented Metrics: an Annotated Bibliographyby: R. W. Whitty v. 31 i. 4 p. 45 - 75
- Letter from the Secretary: The ACM SIGPLAN Web Siteby: Lori L. Pollock v. 31 i. 7 p. 1 - 1
- Using Regional Conferences to Mentor Student Development: A Case Studyby: Michael Hind, Phil Pfeiffer v. 31 i. 7 p. 4 - 7
- Teaching Object-Oriented Design with Heuristicsby: Cleveland A. Gibbon, Colin A. Higgins v. 31 i. 7 p. 12 - 16
- Cool: A Portable Project for Teaching Compiler Constructionby: Alexander Aiken v. 31 i. 7 p. 19 - 24
- Some Comments on 'The Priority-Based Coloring Approach to Register Allocation'by: Arthur Sorkin v. 31 i. 7 p. 25 - 29
- Encapsulation in Object-Oriented Programsby: Jiun-Liang Chen, Feng-Jian Wang v. 31 i. 7 p. 30 - 32
- Process to Process Communication in Prologby: Maurizio Panti, Alessandro Cucchiarelli, M. Mattiucci, Salvatore Valenti v. 31 i. 7 p. 33 - 39
- Interpreting RSets, SSets and Features by Denotational Semanticsby: Vitaliano Milanese v. 31 i. 7 p. 40 - 47
- Sparse Matrix Manipulationby: Preston Briggs v. 31 i. 8 p. 5 - 7
- Why Gawk for AI?by: Ronald Prescott Loui v. 31 i. 8 p. 8 - 9
- Casting in C++: Bringing Safety and Smartness to Your Programsby: G. Bowden Wise v. 31 i. 8 p. 10 - 15
- A Framework for Programming Denotational Semantics in C++by: Nikolaos Papaspyrou v. 31 i. 8 p. 16 - 25
- Thoughts on the 1996 Rochester FORTH Conferenceby: Paul Frenger v. 31 i. 8 p. 26 - 27
- The International Workshop on Parallel C++ (IWPC++), Kanazawa, Ishikawa Prefecture, Japanby: Charles D. Norton v. 31 i. 8 p. 28 - 30
- Comments on Self-Indexed Sortby: Arne Andersson, Andrej Brodnik v. 31 i. 8 p. 40 - 41
- ParCeL-1: A Parallel Programming Language Based on Autonomous and Synchronous Actorsby: Stéphane Vialle, Thierry Cornu, Yannick Lallement v. 31 i. 8 p. 43 - 51
- hcc - A Portable ANSI C Compiler (with a Code Generator for the PowerPCs)by: Mohd Hanafiah Abdullah v. 31 i. 8 p. 52 - 59
- A Note On Type Checking Linear Functional Languagesby: Apostolos Syropoulos v. 31 i. 8 p. 60 - 63
- Porting the mcc PowerPC C/C++ Compiler into an Interactive Development Environmentby: Farooq Butt v. 31 i. 8 p. 64 - 73
- ISO/IEC 10514-1, the Standard for Molula-2: Process Aspectsby: Cornelis Pronk, Martin Schönhacker v. 31 i. 8 p. 74 - 83
- ISO/IEC 10514-1, the Standard for Molula-2: Changes, Clarifications and Additionsby: Martin Schönhacker, Cornelis Pronk v. 31 i. 8 p. 84 - 95
- Supplemental Material from HOPL IIby: Thomas J. Bergin, Richard J. Gibson v. 31 i. 11 p. 9 - 20
- Java as a Better C++by: Joseph Bergin v. 31 i. 11 p. 21 - 27
- Effective use of Assertions in C++by: Mike A. Marin v. 31 i. 11 p. 28 - 32
- Sparse Matric Multiplicationby: Preston Briggs v. 31 i. 11 p. 33 - 37
- 5th Workshop for Doctoral Students in Object-Oriented Systems, Held in Conjunction with ECOOP'95 in Aarhus, Denmarkby: Günter Kniesel, Thilo Kielmann, Athanasios Demiris, Milena Shteto v. 31 i. 11 p. 39 - 48
- Static, Dynamic and Run-Time Modeling of Compound Classesby: Rakesh Agarwal, Giorgio Bruno, Marco Torchiano v. 31 i. 11 p. 49 - 55
- Musical Equational Programs: A Functional Approachby: P. M. van den Broek, Klaas van den Berg v. 31 i. 11 p. 56 - 65
- Porting the Oberon System to AlphaAXPby: Günter Dotzel, Hartmut Goebel v. 31 i. 11 p. 66 - 73
- A Modest Proposal: C++ Resyntaxedby: Ben Werther, Damian Conway v. 31 i. 11 p. 74 - 82
- A Report from OOPSLAby: John R. Pugh v. 31 i. 12 p. 1 - 2
- ECOOP'96 Workshop on Prototype Based Object Oriented Programmingby: James Noble, Antero Taivalsaari v. 31 i. 12 p. 12 - 17
- Pedagogical Patterns - Success in Teaching Object Technology, A Workshop from OOPSLA '96by: Helen Sharp, Mary Lynn Manns, Phil McLaughlin, Maximo Prieto, Mahesh Dodani v. 31 i. 12 p. 18 - 21
- Evolution of the C++ Standard Libraryby: David Dodgson v. 31 i. 12 p. 22 - 26
- "Out of Their Minds" by Dennis Shasha and Cathy Lezereby: Ron Cytron v. 31 i. 12 p. 27 - 28
- Report of TC-2 Working Groupsby: Roger K. DeBry v. 31 i. 12 p. 33 - 38
- Manual and Compiler for the Terse and Modular Language DEMby: Chris Houser v. 31 i. 12 p. 41 - 51
- Using Object-Orientation as a Common Basis for System Development Eduactionby: Jørgen Lindskov Knudsen, Ole Lehrmann Madsen v. 31 i. 12 p. 52 - 62
- Requirements for an Imperative Language to Host Logic Programming in a Seamless Wayby: Giuseppe Callegarin v. 31 i. 12 p. 63 - 68
- Some Comments on Moral and Renvoise's "Global Optimization by Suppression of Partial Redundancies"by: Arthur Sorkin v. 31 i. 12 p. 69 - 72
- Introducing a CPS Style Optimizer into an Existing Compilerby: Richard D. Ferrante, James R. Allard v. 31 i. 12 p. 73 - 79
- A Note On Type Checking Linaer Functional Languagesby: Apostolos Syropoulos v. 31 i. 12 p. 80 - 83
- Logical Objects with Constraintsby: Dianxiang Xu, Guoliang Zheng v. 30 i. 1 p. 5 - 10
- Program Transformation in Constructive Type Theoryby: Ming-Yuan Zhu v. 30 i. 1 p. 11 - 19
- A New Iteration Mechanism for The C++ Programming Languageby: Myung Ho Kim v. 30 i. 1 p. 20 - 26
- Towards Situation-Oriented Programming Languagesby: Erkan Tin, Varol Akman, Murat Ersan v. 30 i. 1 p. 27 - 36
- Poor Man's Watchpointsby: Max Copperman, Jeff Thomas v. 30 i. 1 p. 37 - 44
- 'Use-Once' Variables and Linear Objects - Storage Management, Reflection and Multi-Threadingby: Henry G. Baker v. 30 i. 1 p. 45 - 52
- OVIDE: A Tool for Data Acquisition and Validationby: Pierre Mellier, François Grize v. 30 i. 1 p. 53 - 61
- Foundation of Object-Oriented Languages, 2nd Workshop Reportby: Giuseppe Castagna, Gary T. Leavens v. 30 i. 2 p. 5 - 11
- A Brief Look at Extension Programming Before and Nowby: Liisa Räihä v. 30 i. 2 p. 12 - 20
- The Specification of a Generic Multicomputer Using Lotosby: José A. Gallud, José M. García v. 30 i. 2 p. 21 - 24
- ParsesraP: Using One Grammar to Specify Both Input and Outputby: Steven J. Beaty v. 30 i. 2 p. 25 - 32
- Object Oriented Method for Axiomby: Jean-Louis Boulanger v. 30 i. 2 p. 33 - 41
- Strength Reduction of Multiplications by Integer Constantsby: Youfeng Wu v. 30 i. 2 p. 42 - 48
- Guarded Methods Vs. Inheritance Anomaly: Inheritance Anomaly Solved by Nested Guarded Method Callsby: Szabolcs Ferenczi v. 30 i. 2 p. 49 - 58
- Intelligent And Multi Agent Object Level Computing: The Preliminary Overviewby: Cyrus F. Nourani v. 30 i. 2 p. 59 - 64
- Dynamically-Valued Constants: An Underused Language Featureby: Jonathan L. Schilling v. 30 i. 4 p. 13 - 20
- Multithreading in C++by: John English v. 30 i. 4 p. 21 - 28
- A Comparison of Three Strategies for Computing Letter Oriented, Minimal Perfect Hashing Functionsby: John A. Trono v. 30 i. 4 p. 29 - 35
- User Interface Metricsby: Peter Kokol, Ivan Rozman, Vlado Venuti v. 30 i. 4 p. 36 - 38
- Polymorphic Queries Across Sets, Bags, and Listsby: Limsoon Wong v. 30 i. 4 p. 39 - 44
- Adding Generic Function to Schemeby: Thant Tessman v. 30 i. 4 p. 45 - 50
- Efficient Execution of Programs with Static Semanticsby: George Becker, Neil V. Murray v. 30 i. 4 p. 51 - 60
- Fortran Program Specializationby: Paul Kleinrubatscher, Albert Kriegshaber, Robert Zöchling, Robert Glück v. 30 i. 4 p. 61 - 70
- LISA: A Tool for Automtic Language Implementationby: Marjan Mernik, Nikolaj Korbar, Viljem Zumer v. 30 i. 4 p. 71 - 79
- Proper Packaging Promotes Parameter Passing Profiencyby: John F. Cigas v. 30 i. 4 p. 80 - 80
- How to Evaluate Object-Oriented Software Development?by: Bruno Stiglic, Marjan Hericko, Ivan Rozman v. 30 i. 5 p. 3 - 10
- Umbriel - Another Minimal Programming Languageby: P. D. Terry v. 30 i. 5 p. 11 - 17
- Bottom in the Imperative Worldby: Apostolos Syropoulos, Alexandros Karakos v. 30 i. 5 p. 18 - 20
- Covariant Deep Subtyping Reconsideredby: David L. Shang v. 30 i. 5 p. 21 - 28
- Implementing FORTRAN77 Support in the GNU gdb Debuggerby: Farooq Butt v. 30 i. 5 p. 29 - 36
- PROMIS: A Software Metrics Tool Generatorby: Peter Kokol, Viljem Zumer, Janez Brest, Marjan Mernik v. 30 i. 5 p. 37 - 42
- L-Systems with Inheritance: An Object-Oriented Extension of L-Systemsby: Igor A. Borovikov v. 30 i. 5 p. 43 - 60
- Report of a Workshop on Future Directions in Programming Languages and Compilersby: Samuel N. Kamin v. 30 i. 7 p. 9 - 28
- A Brief Essay on Capabilitiesby: Marco de Vivo, Gabriela O. de Vivo, Luis Gonzalez v. 30 i. 7 p. 29 - 36
- A Project-Based Approach to Programming Language Evaluationby: James W. Howatt v. 30 i. 7 p. 37 - 40
- Formulating Update Messagesby: Jon. Hallett v. 30 i. 7 p. 41 - 44
- Representing Calendrical Algorithms and Data in Prolog and Prolog IIIby: Pavol Návrat, Mária Bieliková v. 30 i. 7 p. 45 - 51
- Introducing Virtual Instance Variables in Classes to Provide Sufficient Support for Encapsulationby: Li XueDong, Guoliang Zheng v. 30 i. 7 p. 52 - 56
- Object-Oriented Programming for Embedded Systemsby: Stuart Maclean, Sean Smith v. 30 i. 9 p. 3 - 8
- A Pragmatic Approach to C++, Eiffel and Ada 9X Programmingby: Gabriela O. de Vivo, Marco de Vivo v. 30 i. 9 p. 9 - 16
- CONS Should Not CONS Its Arguments, Part II: Cheney on the M.T.Aby: Henry G. Baker v. 30 i. 9 p. 17 - 20
- A Functional FOR Loopby: Chung-Kwong Yuen v. 30 i. 9 p. 21 - 24
- The Checkers Problem: A Solution with Linear Time Complexityby: Karl Traunmüller v. 30 i. 9 p. 25 - 32
- What is a Procedure Call?by: Brian L. Meek v. 30 i. 9 p. 33 - 40
- Introducting Data Decomposition into VDM for Tractable Development of Programsby: Jian Lu v. 30 i. 9 p. 41 - 50
- Making C++ Practical for Business Applications: 3 Essential Classesby: Conrad Weisert v. 30 i. 12 p. 4 - 8
- Efficient Parallel Recursionby: Per Brinch Hansen v. 30 i. 12 p. 9 - 16
- A Rule-based and Object-Oriented AI Programming Languageby: Tao Li v. 30 i. 12 p. 17 - 24
- A New Approach for Efficient Implementation of ADA Multi-Taskingby: Gansheng Li v. 30 i. 12 p. 25 - 31
- CST: C State Transformersby: John D. Ramsdell v. 30 i. 12 p. 32 - 36
- A New Methodology of Data Dependence Analysis for Parallelizing C++by: Zhu Genjiang, Xie Li, Sun Zhongxiu v. 30 i. 12 p. 37 - 42
- Disceplined Cby: Yves L. Noyelle v. 30 i. 12 p. 43 - 50
- An Approach to Executable Specifications, Based On Formal Source-To-Source Conversionby: Zhang Xinger v. 30 i. 12 p. 51 - 58
- Module Types, Module Variables, and Their Use as a Universal Encapsulation Mechanismby: Atanas Radenski v. 29 i. 1 p. 3 - 8
- The Self-Similarity and Computer Programsby: Peter Kokol v. 29 i. 1 p. 9 - 12
- Computational Reflection in PowerEpsilonby: Ming-Yuan Zhu v. 29 i. 1 p. 13 - 19
- Extending PowerEpsilon with Algebraic Rewritingby: Zeng Li-Xin, Zhu Ming-Yuan v. 29 i. 1 p. 20 - 26
- Using ABC To Prototype VDM Specificationsby: Aaron Kans, Clive Hayton v. 29 i. 1 p. 27 - 36
- Program Profiling Problems, and a Solution via Machine Language Rewritingby: John F. Reiser, Joseph P. Skudlarek v. 29 i. 1 p. 37 - 45
- Parsing with C++ Classesby: Damian Conway v. 29 i. 1 p. 46 - 52
- Uniprep - Preparing a C/C++ Compiler for Unicodeby: Martin J. Dürst v. 29 i. 1 p. 53 - 53
- A Bibliography on Parallel Parsingby: Henk Alblas, Rieks op den Akker, Paul Oude Luttighuis, Klaas Sikkel v. 29 i. 1 p. 54 - 65
- A "Linear Logic" Quicksortby: Henry G. Baker v. 29 i. 2 p. 13 - 18
- A Path-Based Method of Parallelizing C++ Programsby: Zhu Genjiang, Xie Li, Sun Zhongxiu v. 29 i. 2 p. 19 - 24
- A Review of Exploitation of And-Parallelism and Combined And/Or-Parallelism in Logic Programsby: Kang Zhang v. 29 i. 2 p. 25 - 32
- Terminable Statements and Destructive Computationby: Boyko B. Bantchev v. 29 i. 2 p. 33 - 38
- Non-Linear Type Extensionsby: Bob Brown v. 29 i. 2 p. 39 - 43
- Does Scheme Enhance an Introductory Programming Course? Some Preliminary Empirical Resultsby: A. Michael Berman v. 29 i. 2 p. 44 - 48
- Foundations of Object-Oriented Languages - Workshop Reportby: Andrew P. Black, Jens Palsberg v. 29 i. 3 p. 3 - 11
- Parallel Multiplication: A Case Study in Parallel Programmingby: Chung-Kwong Yuen, Ming-Dong Feng v. 29 i. 3 p. 12 - 17
- A Critical Look At Some Ada Featuresby: S. Srinivasan v. 29 i. 3 p. 18 - 22
- Programming the Premature Loop Exit: From Functional to Navigationalby: Chung-Kwong Yuen v. 29 i. 3 p. 23 - 27
- Propagation of Constants and Assertionsby: Alexander Sakharov v. 29 i. 3 p. 28 - 32
- Using Producer and Consumer Manipulators to Extend Stream I/O Formatting in C++by: Michael Rizzo v. 29 i. 3 p. 33 - 35
- Bug Analysis of Pascal Programsby: K. S. R. Anjaneyulu v. 29 i. 4 p. 15 - 22
- Using Memoization to Achieve Polynomial Complexity of Purely Functional Executable Specifications of Non-Deterministic Top-Down Parsersby: Richard A. Frost v. 29 i. 4 p. 23 - 30
- A Geometrical Data-Parallel Languageby: Jean-Luc Dekeyser, Dominique Lazure, Philippe Marquet v. 29 i. 4 p. 31 - 40
- Developing An Interprocedural Optimizing Compilerby: Jon Loeliger, Robert Metzger v. 29 i. 4 p. 41 - 48
- Programming Languages: Towards Greater Commonalityby: Brian L. Meek v. 29 i. 4 p. 49 - 57
- Thermodynamics and Garbage Collectionby: Henry G. Baker v. 29 i. 4 p. 58 - 63
- Propagation of Constants and Assertionsby: Alexander Sakharov v. 29 i. 5 p. 3 - 6
- Configurable RECby: Gerardo Cisneros v. 29 i. 5 p. 7 - 16
- A General, Fine-Grained, Machine Independent, Object-Oriented Languageby: Birger Andersen v. 29 i. 5 p. 17 - 26
- Continuations Without Copyingby: Scott Burson v. 29 i. 5 p. 27 - 30
- Passing Large Dynamic Objects out of Function Frame Boundaries: The Temporary Linked List Methodby: Ahsan J. Sharafuddin, Nathan Ida, James E. Grover v. 29 i. 5 p. 31 - 36
- Experience in Teaching Object-Oriented Programming with C++by: Emilia Zivkova v. 29 i. 5 p. 37 - 40
- Agent Language NUML and Its Reduction Implementation Model Based on HOpiby: Xu Manwu, Lu Jianfeng, Zeng Fancong, Dai Jingwen v. 29 i. 5 p. 41 - 48
- Higher Order Objects in pure Object-Oriented Languagesby: Thomas Kühne v. 29 i. 7 p. 15 - 20
- A Graph Model for Object Oriented Programmingby: Peter Grogono, Mark Gargul v. 29 i. 7 p. 21 - 28
- Formal Methods: From Object-Based to Object-Orientedby: Frank van der Linden v. 29 i. 7 p. 29 - 38
- KL1 and the Early Days of the FGCS Projectby: Andrew Davison v. 29 i. 7 p. 39 - 41
- Is Circularity for Attribute Grammars Exponential-Time Complete?by: Pei-Chi Wu, Feng-Jian Wang v. 29 i. 7 p. 42 - 42
- Detection of Cycle in Real-Time System Specificationby: Tereza G. Kirner v. 29 i. 7 p. 43 - 50
- J+ = Jby: Michael Wolfe v. 29 i. 7 p. 51 - 53
- Multibox Parsersby: Lev J. Dyadkin v. 29 i. 7 p. 54 - 60
- Concurrency Annotations in C++by: Carlos Baquero, Francisco Moura v. 29 i. 7 p. 61 - 67
- Parsing with C++ Deferred Expressionsby: Damian Conway v. 29 i. 9 p. 9 - 16
- About Conversations for Concurrent OO Languagesby: Alexander B. Romanovsky v. 29 i. 9 p. 17 - 21
- A Reconfigurable Data Flow Machine for Implementing Functional Programming Languagesby: Christophe G. Giraud-Carrier v. 29 i. 9 p. 22 - 28
- A Multiparadigm Approach to Compiler Constructionby: Timothy P. Justice, Rajeev K. Pandey, Timothy A. Budd v. 29 i. 9 p. 29 - 37
- Minimum Reference Count Updating with Deferred and Anchored Pointers for Functional Data Structuresby: Henry G. Baker v. 29 i. 9 p. 38 - 43
- Basic operations of the VisiCola scope modelby: Michael A. Klug v. 29 i. 9 p. 44 - 50
- Breadth-first search in the Eight Queens Problemby: Chung-Kwong Yuen, Ming-Dong Feng v. 29 i. 9 p. 51 - 55
- Using attribute grammars to find solutions for musical equational programsby: Myriam Desainte-Catherine, Kablan Barbar v. 29 i. 9 p. 56 - 63
- Padded string: treating string as sequence of machine wordsby: Pei-Chi Wu, Feng-Jian Wang v. 29 i. 9 p. 64 - 67
- Pool: an unbounded arrayby: Pei-Chi Wu, Feng-Jian Wang v. 29 i. 9 p. 68 - 71
- A production system language KDOPSby: Jing Li, Yulin Feng v. 29 i. 9 p. 72 - 76
- The IFAD VDM-SL toolbox: a practical approach to formal specificationsby: René Elmstrøm, Peter Gorm Larsen, Poul Bøgh Lassen v. 29 i. 9 p. 77 - 80
- Conceptual modeling and programming languagesby: Bent Bruun Kristensen, Kasper Østerbye v. 29 i. 9 p. 81 - 90
- The game of life: a CLEAN programming tutorial and case studyby: Anthony H. Dekker v. 29 i. 9 p. 91 - 114
- Adaptive automata for context-dependent languagesby: João José Neto v. 29 i. 9 p. 115 - 124
- Object analysis of programby: Vladimir I. Shelekhov, Sergey V. Kuksenko v. 29 i. 9 p. 125 - 134
- Fully static dimensional analysis with C++by: Zerksis D. Umrigar v. 29 i. 9 p. 135 - 139
- An annotated bibliography of interactive program steeringby: Weiming Gu, Jeffrey S. Vetter, Karsten Schwan v. 29 i. 9 p. 140 - 148
- A bibliography on garbage collection and related topicsby: Nandakumar Sankaran v. 29 i. 9 p. 149 - 158
- A taxonomy of datatypesby: Brian L. Meek v. 29 i. 9 p. 159 - 167
- 4th Workshop for Doctoral Student in Object-Oriented Systems, Held in Conjunction with ECOOP'94 (Report)by: Thilo Kielmann, Mira Mezini, Arjan Loeffen v. 29 i. 12 p. 7 - 10
- ACM SIGPLAN Workshop on Language, Compiler, and Tool Support for Real-Time Systems, 1994 (Summary of the Workshop)by: Azer Bestavros, Richard Gerber, Stephen P. Masticola v. 29 i. 12 p. 11 - 17
- A Report on Object-Oriented Extensions to Pascalby: Joseph Bergin v. 29 i. 12 p. 18 - 24
- Fusing Loops With Backward Inter Loop Data Dependenceby: Amit Ganesh v. 29 i. 12 p. 25 - 30
- SUIF: An Infrastructure for Research on Parallelizing and Optimizing Compilersby: Robert P. Wilson, Robert S. French, Christopher S. Wilson, Saman P. Amarasinghe, Jennifer-Ann M. Anderson, Steven W. K. Tjiang, Shih-Wei Liao, Chau-Wen Tseng, Mary W. Hall, Monica S. Lam, John L. Hennessy v. 29 i. 12 p. 31 - 37
- An Extensible Program Representation for Object-Oriented Softwareby: Brian Mallo, John D. McGregor, Anand Krishnaswamy, Murali Medikonda v. 29 i. 12 p. 38 - 47
- Agora: Message Passing as a Foundation for Exploring OO Language Conceptsby: Wim Codenie, Koen D'Hont, Theo D'Hondt, Patrick Steyaert v. 29 i. 12 p. 48 - 57
- Covariant Specificationby: David L. Shang v. 29 i. 12 p. 58 - 65
- Considerations in Choosing a Concurrent/Distributed Object-Oriented Programming Languageby: Michael L. Nelson v. 29 i. 12 p. 66 - 71
- Comment on Poor Practice in Coding Examplesby: Conrad Weisert v. 29 i. 12 p. 72 - 72
- Rapid Development of a Source-Level Debugger for PowerPC Microprocessorsby: Farooq Butt v. 29 i. 12 p. 73 - 77
- The C++ Interface in Objectivityby: Rakesh Agarwal v. 29 i. 12 p. 78 - 86
- Remarks on A Methodoly for Implementing Highly Concurrent Data Objectsby: Joseph P. Skudlarek v. 29 i. 12 p. 87 - 93
- Using YACC and Lex with C++by: Bruce Hahne, Hiroyuki Sato v. 29 i. 12 p. 94 - 103
- Better C: An Object-Oriented C Language with Automatic Memory Manager Suitable for Interactive Applicationsby: Thomas Wang v. 29 i. 12 p. 104 - 111
- Eliminate Memory Fragmentation through Holes in the Heapby: Thomas Wang v. 29 i. 12 p. 112 - 113
- On Subprograms With A Variable Number Of Parameters Of Varying Typesby: Baowen Xu v. 28 i. 2 p. 14 - 20
- An Executable Language Definitionby: William M. Waite v. 28 i. 2 p. 21 - 40
- On the Type Extensions of Oberon-2by: Libero Nigro v. 28 i. 2 p. 41 - 44
- Concurrent Object Oriented 'C' (cooC)by: Rajiv Trehan, Nobuyuki Sawashima, Akira Morishita, Ichiro Tomoda, Toru Imai, Ken-ichi Maeda v. 28 i. 2 p. 45 - 52
- An Integrated Prolog Programming Environmentby: Uwe Schreiweis, A. Keune, Horst Langendörfer v. 28 i. 2 p. 53 - 60
- Typographical Extensions for Programming Languages: Breaking out of the ASCII Straitjacketby: Paul W. Abrahams v. 28 i. 2 p. 61 - 68
- Has the King Returned?by: Conrad Weisert v. 28 i. 4 p. 9 - 10
- ALBA: A Parallel Language Based on Actorsby: Juan Hernández Núñez, Pedro de Miguel, Manuel Barrena García, Juan Miguel Martínez, Antonio Polo Márquez, Manuel M. Nieto Rodríguez v. 28 i. 4 p. 11 - 20
- An Integrated Prolog Programming Environmentby: Uwe Schreiweis, A. Keune, Horst Langendörfer v. 28 i. 4 p. 21 - 28
- A Definition of an ISWIM-Like Language via Schemeby: Mirjana Ivanovic, Zoran Budimac v. 28 i. 4 p. 29 - 38
- Adapting a Debugger for Optimized Programsby: William S. Shu v. 28 i. 4 p. 39 - 44
- Anonymous Routine-Texts: an Orthogonal Approach to Block Objectsby: Otto Stolz v. 28 i. 4 p. 45 - 48
- CRL/Pascal: A Pascal-oriented Cross Reference Language And Its Applicationsby: Baowen Xu v. 28 i. 4 p. 49 - 54
- 'Infant Mortality' and Generational Garbage Collectionby: Henry G. Baker v. 28 i. 4 p. 55 - 57
- 15th July 1972: A Significant Moment for Logic Programmingby: Andrew Davison v. 28 i. 4 p. 58 - 60
- A Systematic Approach to Multiple Inheritance Implementationby: Josef Templ v. 28 i. 4 p. 61 - 66
- Parsing with C++ Constructorsby: Philip W. Hall IV v. 28 i. 4 p. 67 - 68
- Comment on Cooper and Kennedy's Flow-Insensitive Interprocedural Summary Information Computation Algorithmby: Shibin Hu v. 28 i. 5 p. 3 - 8
- Dynamic Semantic Sepcification by Two-Level Grammars for a Block Structured Language with Subroutine Parametersby: F. Badii, Fatemeh Abdollahzadeh v. 28 i. 5 p. 9 - 18
- And/Or Parallel Execution of Logic Programs: Exploiting Dependent And-Parallelismby: Zheng Yuhua, Tu Honglei, Xie Li v. 28 i. 5 p. 19 - 28
- A Variation on Knoop, Rüthing, and Steffen's Lazy Code Motionby: Karl-Heinz Drechsler, Manfred P. Stadel v. 28 i. 5 p. 29 - 38
- Fips: A Functional-Imperative Language for Explorative Programmingby: Jacek Passia, Klaus-Peter Löhr v. 28 i. 5 p. 39 - 48
- Generalized Regular Expressions - A Programming Exercise in Haskellby: E. P. Wentworth v. 28 i. 5 p. 49 - 54
- PIDL / Pascal: A Pascal-oriented Program Interface Description Language And Its Applicationsby: Baowen Xu v. 28 i. 5 p. 53 - 62
- A Prototype of an Interface Bilder for the Common Lisp Interface Manager - CLIBby: Jan Hesse, Rainer König, Filippo Logi, Jens Herder v. 28 i. 8 p. 19 - 28
- C++ in Eight Weeksby: Kailash Chandra v. 28 i. 8 p. 29 - 38
- Fail-Safe Programming in Compiler Optimizationby: Jonathan L. Schilling v. 28 i. 8 p. 39 - 42
- Two-Level Grammars are More Expressive Than Type 0 Grammars Or are They?by: Dick Grune v. 28 i. 8 p. 43 - 45
- An Approach Toward Mechanization of Acquiring Reusable Software Componentsby: Zongming Fei, Jian Lu v. 28 i. 8 p. 46 - 52
- On Defusing a Small Landmine in the Type Casting of Pointers in the 'C' Languageby: Edward W. Czeck, James M. Feldman v. 28 i. 8 p. 53 - 56
- How Does PASCAL-XSC Compare to Other Programming Languages with Respect to the IEEE Standard?by: Pascal Janssens, Annie A. M. Cuyt v. 28 i. 8 p. 57 - 66
- Five Principles for the Formal Validation of Models of Software Metricsby: Lem O. Ejiogu v. 28 i. 8 p. 67 - 76
- Edicates - A Specification Of Calling Sequencesby: Mark Cashman v. 28 i. 8 p. 77 - 80
- Types in Schoolby: Noemi de La Rocque Rodriguez, Roberto Ierusalimschy, José Lucas Rangel v. 28 i. 8 p. 81 - 89
- Abotec: An Autmatic Back-of-the-Envelope Calculatorby: Malcolm J. Shute v. 28 i. 8 p. 90 - 98
- Compiling Machine-Independent Parallel Programsby: Michael Philippsen, Ernst A. Heinz, Paul Lukowicz v. 28 i. 8 p. 99 - 108
- "D2R": A Dynamic Dataflow Representation for Task Schedulingby: Johann Rost v. 28 i. 8 p. 109 - 116
- Parallel Bounded Quantification - Preliminary Resultsby: Henrik Arro, Jonas Barklund, Johan Bevemyr v. 28 i. 8 p. 117 - 124
- Announcing the Release of Aquarius Prologby: Thomas W. Getzinger, Ralph Clarke Haygood, Peter Van Roy v. 28 i. 9 p. 5 - 5
- Report on the Second Annual Alan J. Perlis Symposium on Programming Languagesby: Phil Pfeiffer v. 28 i. 9 p. 6 - 12
- Object Oriented Programming: The Fundamentalsby: Richie Bielak v. 28 i. 9 p. 13 - 14
- A Taste of the Modula-2 Standardby: Mark Woodman v. 28 i. 9 p. 15 - 24
- Comment on a Comment by Shibin Huby: John Banning v. 28 i. 9 p. 25 - 25
- Spreadsheets: A Research Agendaby: Doug Bell, Mike Parr v. 28 i. 9 p. 26 - 28
- A Survey of Implementations of Concurrent, Parallel and Distributed Smalltalkby: Yaoqing Gao, Chung-Kwong Yuen v. 28 i. 9 p. 29 - 35
- Inheritance versus Containmentby: Rainer H. Liffers v. 28 i. 9 p. 36 - 38
- A 100% Portable Inline-Debuggerby: Jürgen Heymann v. 28 i. 9 p. 39 - 46
- A Simple Implementation Technique for Mixin Inheritanceby: Michael E. Goldsby v. 28 i. 9 p. 47 - 56
- Is Object-Oriented Programming Structured Programming?by: Bernd Müller v. 28 i. 9 p. 57 - 66
- Pointer-Induced Aliasing: A Clarificationby: Thomas J. Marlowe, Jong-Deok Choi, William Landi, Michael G. Burke, Barbara G. Ryder, Paul R. Carini v. 28 i. 9 p. 67 - 70
- Comment on a Comment by Shibin Huby: John Banning v. 28 i. 11 p. 3 - 3
- How to Give a Good Research Talkby: Simon L. Peyton Jones, John Hughes, John Launchbury v. 28 i. 11 p. 9 - 12
- A Modest Proposal Concerning Variables and Assignment Statementsby: Frank A. Adrian v. 28 i. 11 p. 13 - 15
- Verification of Proofs for the B Formal Development Processby: Babak Dehbonei, Fernando Mejia v. 28 i. 11 p. 16 - 21
- Complex Gaussian Integers for 'Gaussian Graphics'by: Henry G. Baker v. 28 i. 11 p. 22 - 27
- Parametrized Methodsby: José de Oliveira Guimarães v. 28 i. 11 p. 28 - 32
- Projecting Functional Models of Imperative Programsby: Mark Harman, Sebastian Danicic v. 28 i. 11 p. 33 - 41
- An Introduction to the Extended Pascal Languageby: Tony Hetherington v. 28 i. 11 p. 42 - 51
- Blocks and Proceduresby: Heiko Kießling, Uwe Krüger v. 28 i. 11 p. 52 - 61
- USSA - universal syntax and semantics analyzerby: Boris Burshteyn v. 27 i. 1 p. 42 - 60
- Analysis and refutation of the LCASby: William Kahan v. 27 i. 1 p. 61 - 74
- Edison, a Unix and C friendly Rete based production systemby: Bernard Thirion v. 27 i. 1 p. 75 - 84
- An object-oriented specification for compilerby: Pei-Chi Wu, Feng-Jian Wang v. 27 i. 1 p. 85 - 94
- Computing A*B (mod N) efficiently in ANSI Cby: Henry G. Baker v. 27 i. 1 p. 95 - 98
- Arrays and pointers considered harmfulby: Darrel C. Ince v. 27 i. 1 p. 99 - 104
- Analogy by generalization - and the quest of the grailby: Antonio L. Furtado v. 27 i. 1 p. 105 - 113
- Parallel module specification on SLPXby: Cyrus F. Nourani v. 27 i. 1 p. 114 - 115
- RT-MODULA2: an embedded in MODULA2 language for writing concurrent and real time programsby: Juan Hernández, Juan Antonio Sanchez v. 27 i. 2 p. 26 - 36
- Enhancing program comprehension: formatting and documentingby: Mouloud Arab v. 27 i. 2 p. 37 - 46
- Object-oriented programs in realtimeby: J. M. Gwinn v. 27 i. 2 p. 47 - 56
- Linear control flow analysisby: Steven Ryan v. 27 i. 2 p. 57 - 64
- Integrating destructive assignment and lazy evaluation in the multiparadigm language G-2by: John Placer v. 27 i. 2 p. 65 - 74
- A FORTRAN IV to QuickBASIC translatorby: Rizaldo B. Caringal, Phan Minh Dung v. 27 i. 2 p. 75 - 87
- PCCTS reference manual: version 1.00by: Terence J. Parr, Henry G. Dietz, William E. Cohen v. 27 i. 2 p. 88 - 165
- CONS should not CONS its arguments, or, a lazy alloc is a smart allocby: Henry G. Baker v. 27 i. 3 p. 24 - 34
- Four Dimensions of programming-language independenceby: Daniel J. Salomon v. 27 i. 3 p. 35 - 53
- Empirical study of motivation in a entry level programming courseby: Salvatore Mamone v. 27 i. 3 p. 54 - 60
- A compact syntax chart for Adaby: J. M. Watt v. 27 i. 3 p. 61 - 65
- The treadmill: real-time garbage collection without motion sicknessby: Henry G. Baker v. 27 i. 3 p. 66 - 70
- An observation on the C library procedure random()by: Thomas A. Anastasio, William W. Carlson v. 27 i. 3 p. 71 - 74
- Scanning regular languages by dual finite automataby: Pei-Chi Wu, Feng-Jian Wang, Kai-Ru Young v. 27 i. 4 p. 12 - 16
- Modula-2 an alternative to C?by: Jürgen Angele, Detlef Küpper v. 27 i. 4 p. 17 - 26
- Two models of object-oriented programming and the Common Lisp Object Systemby: Norman Young v. 27 i. 4 p. 27 - 36
- Noised or filtered programming? (about enumerated types)by: Michel Gauthier v. 27 i. 4 p. 37 - 40
- Exploratory language designby: Edward A. Ipser Jr. v. 27 i. 4 p. 41 - 50
- Two flaws of the current C++ language definitionby: Ronald Fischer v. 27 i. 4 p. 51 - 54
- Linear expression boundingby: Steven Ryan v. 27 i. 4 p. 55 - 58
- Linear data flow analysisby: Steven Ryan v. 27 i. 4 p. 59 - 67
- BURG: fast optimal instruction selection and tree parsingby: Christopher W. Fraser, Robert R. Henry, Todd A. Proebsting v. 27 i. 4 p. 68 - 76
- A bibliography on syntax error handling in context free languagesby: Peter N. van den Bosch v. 27 i. 4 p. 77 - 86
- Is POPL mathematics or science?by: Andrew W. Appel v. 27 i. 4 p. 87 - 89
- SIGPLAN Notices Special Issue on the Functional Programming Language Haskellby: Joseph H. Fasel, Paul Hudak, Simon L. Peyton Jones, Philip Wadler v. 27 i. 5 p. 1 - 1
- Report on the Programming Language Haskell, A Non-strict, Purely Functional Languageby: Paul Hudak, Simon L. Peyton Jones, Philip Wadler, Brian Boutel, Jon Fairbairn, Joseph H. Fasel, María M. Guzmán, Kevin Hammond, John Hughes, Thomas Johnsson, Richard B. Kieburtz, Rishiyur S. Nikhil, Will Partain, John Peterson v. 27 i. 5 p. 1
- A Gentle Introduction to Haskellby: Paul Hudak, Joseph H. Fasel v. 27 i. 5 p. 1
- Real programmers don't use spreadsheetsby: Rommert J. Casimir v. 27 i. 6 p. 10 - 16
- Binary wrapping: a technique for instrumenting object codeby: Jonathan M. Cargille, Barton P. Miller v. 27 i. 6 p. 17 - 18
- Proxy: an interpreter for rapid prototypingby: Burt M. Leavenworth v. 27 i. 6 p. 19 - 28
- Lazy evaluation of C++ static constructorsby: Marc Sabatella v. 27 i. 6 p. 29 - 36
- A quick introduction to the programming language MIKEby: K. Coolsaet v. 27 i. 6 p. 37 - 46
- A new language for multicomputer programmingby: José M. García Carrasco v. 27 i. 6 p. 47 - 53
- The semantics of CATby: Ronald E. Prather v. 27 i. 6 p. 54 - 63
- How to write a C++ language extension proposal for ANSI-X3J16/ISO-WG21v. 27 i. 6 p. 64 - 71
- Guarded attribute grammars: top down parsing and left recursive productionsby: Richard A. Frost v. 27 i. 6 p. 72 - 75
- Polymorphism considered harmfulby: Carl Ponder, Bill Bush v. 27 i. 6 p. 76 - 79
- On understanding type declarations in Cby: R. P. Mody v. 27 i. 6 p. 80 - 83
- Where is the evidence against arrays and pointers?by: Markku Sakkinen v. 27 i. 6 p. 84 - 85
- Modula-3 language definitionby: Luca Cardelli, James E. Donahue, Lucille Glassman, Mick J. Jordan, Bill Kalsow, Greg Nelson v. 27 i. 8 p. 15 - 42
- Industrial strength compiler construction with equationsby: Lutz H. Hamel v. 27 i. 8 p. 43 - 50
- The Hermes language in outline formby: Andy Lowry v. 27 i. 8 p. 51 - 70
- Hamming numbers, lazy evaluation, and eager disposalby: Chung-Kwong Yuen v. 27 i. 8 p. 71 - 75
- An overview of the ISO/VDM-SL standardby: Nico Plat, Peter Gorm Larsen v. 27 i. 8 p. 76 - 82
- Treating statement sequences as block objectsby: Hanspeter Mössenböck v. 27 i. 8 p. 83 - 86
- Software patents: an example of the threatby: Paul W. Abrahams v. 27 i. 8 p. 87 - 88
- Lively linear Lisp: "look ma, no garbage!"by: Henry G. Baker v. 27 i. 8 p. 89 - 98
- A cellular automata simulation system: version 2.0by: J. Dana Eckart v. 27 i. 8 p. 99 - 106
- Cellang 2.0: language reference manualby: J. Dana Eckart v. 27 i. 8 p. 107 - 112
- Functional programming is not self-modifying codeby: R. P. Mody v. 27 i. 11 p. 13 - 14
- Less complex elementary functionsby: Henry G. Baker v. 27 i. 11 p. 15 - 16
- ConstraintLisp: an object-oriented constraint programming languageby: Bing Liu, Yuen-Wah Ku v. 27 i. 11 p. 17 - 26
- LogC: a language and environment for embedded rule based systemsby: Feng Yulin, Huang Tao, Li Jing v. 27 i. 11 p. 27 - 32
- A modulus oriented hash function for the construction of minimal perfect tablesby: Maurizio Panti, Salvatore Valenti v. 27 i. 11 p. 33 - 38
- Dynamic parsers and evolving grammarsby: S. Cabasino, Pier Stanislao Paolucci, G. M. Todesco v. 27 i. 11 p. 39 - 48
- Unification based FP interpretersby: Chris Fickert, Thomas Sudkamp v. 27 i. 11 p. 49 - 58
- Macro processing in high-level languagesby: Alexander Sakharov v. 27 i. 11 p. 59 - 66
- Macros for defining C++ classesby: Conrad Weisert v. 27 i. 11 p. 67 - 76
- An abstract machine design for lexically scoped parallel Lisp with speculative processingby: Chung-Kwong Yuen v. 27 i. 11 p. 77 - 84
- MANEVRO: a new approach to class based programmingby: Srdjan Mijanovic v. 27 i. 11 p. 85 - 89
- Programming environments: report on an international workshop at Dagstuhl Castleby: Paul Klint, Thomas W. Reps, Gregor Snelting v. 27 i. 11 p. 90 - 96
- Report on the CHI'91 Workshop on Languages for Developing User Interfacesby: Brad A. Myers v. 27 i. 12 p. 8 - 12
- Application of Measurement Theory to Software Metrics - Comments on the Bollmann-Zuse Approachby: Erhard Konrad v. 27 i. 12 p. 13 - 19
- Reply to: Application of Measurement Theory to Software Metrics - Comments on the Bollmann-Zuse Approachby: Horst Zuse, Peter Bollmann-Sdorra v. 27 i. 12 p. 20 - 27
- Did Turing Discover How the Leopard Got Its Spots?by: Robert Pool v. 27 i. 12 p. 28 - 28
- The Metric Based Compiler - A Current Requirementby: Reiner R. Dumke, Kerstin Neumann, Kerstin Stoeffler v. 27 i. 12 p. 29 - 38
- Inlining Semantics for Subroutines which are Recursiveby: Henry G. Baker v. 27 i. 12 p. 39 - 46
- Template Instantiation For C++by: Glen McCluskey, Robert B. Murray v. 27 i. 12 p. 47 - 65
- Feature Inversion: A Practice on Language Versions Determinationby: K. C. Wong v. 27 i. 12 p. 57 - 60
- The Calculation of Easterby: Ryan Stansifer v. 27 i. 12 p. 61 - 65
- Combining Objects and Relationsby: Gottfried Razek v. 27 i. 12 p. 66 - 70
- Empirical Measurements of Six Allocation-intensive C Programsby: Benjamin G. Zorn, Dirk Grunwald v. 27 i. 12 p. 71 - 80
- Another C Threads Libraryby: G. Cattaneo, G. Di Giore, M. Ruotolo v. 27 i. 12 p. 81 - 90
- An annotated bibliography of literate programmingby: Lisa M. Smith, Mansur H. Samadzadeh v. 26 i. 1 p. 14 - 20
- A bibliography of parallel debuggers, 1990 editionby: Cherri M. Pancake, Sue Utter-Honig v. 26 i. 1 p. 21 - 37
- A comparison of module constructs in programming languagesby: Frank W. Calliss v. 26 i. 1 p. 38 - 46
- Path feasibility, linear optimizers and the evaluate standard formby: P. David Coward v. 26 i. 1 p. 47 - 56
- Cluster: an informal reportby: Shang Lujun v. 26 i. 1 p. 57 - 74
- Essential language el(alpha) - a reduced expression set language for system programmingby: Tan Watanabe, Kazuko Sakuma, Hideyuki Arai, Kohbun Umetani v. 26 i. 1 p. 85 - 98
- Object oriented programming techniques to replace software components on the fly in a running programby: Manfred P. Stadel v. 26 i. 1 p. 99 - 108
- HARE: an optimizing portable compiler for Schemeby: Dan Teodosiu v. 26 i. 1 p. 109 - 120
- The rewards of generating true 32-bit codeby: Michael Franz v. 26 i. 1 p. 121 - 123
- TM: a systematic methodology of software metricsby: Lem O. Ejiogu v. 26 i. 1 p. 124 - 132
- GCODE: a revised standard for a graph representation for functional programsby: Mike Joy, Tom Axford v. 26 i. 1 p. 133 - 139
- A short introduction to the ABC languageby: Steven Pemberton v. 26 i. 2 p. 11 - 16
- Building abstract iterators using continuationsby: Christopher Coyle, Peter Crogono v. 26 i. 2 p. 17 - 24
- Incremental reduction with nested constraintsby: E. Mark Gold v. 26 i. 2 p. 25 - 34
- The benefits of enumerated types in Modula-2by: Mark Cashman v. 26 i. 2 p. 35 - 39
- A plea for readable pleas for a readable Prolog programming styleby: Randy M. Kaplan v. 26 i. 2 p. 41 - 50
- VisiCola, a model and a language for visibility control in programming languagesby: Michael A. Klug v. 26 i. 2 p. 51 - 63
- Implementing C function calls in rules for an expert system shellby: B. I. B. Madhav, Narayan Hegde v. 26 i. 2 p. 64 - 66
- SetLog, a tool for experimenting with new semanticsby: Marco Pellegrini, Raimondo Sepe v. 26 i. 2 p. 67 - 74
- Turtle walk through functional languageby: Zoran Putnik, Zoran Budimac, Mirjana Ivanovic v. 26 i. 2 p. 75 - 82
- Fortran 90 arraysby: Robert Bernecky v. 26 i. 2 p. 83 - 98
- The ensemble system: concurrent programming on a personal computerby: Michele Di Santo, Wilma Russo v. 26 i. 2 p. 99 - 108
- Automated generation of code using backtracking parsers for attribute grammarsby: Wolfgang Keller v. 26 i. 2 p. 109 - 117
- Multiparadigm research: a new direction of language designby: John Placer v. 26 i. 3 p. 9 - 17
- A note on modifiable grammarsby: George H. Roberts v. 26 i. 3 p. 18 - 18
- Searching in discrete universesby: George H. Roberts v. 26 i. 3 p. 19 - 24
- Executing the formal definition of Adaby: Alessandro Fantechi, Stefania Gnesi, F. Leggio, P. Talini v. 26 i. 3 p. 25 - 34
- Toward integrating imperative and logic programming paradigms: WYSIWYG approach to PROLOG programmingby: Claudio Delrieux, Pablo R. Azero Alcocer, Fernando Tohmé v. 26 i. 3 p. 35 - 44
- Some issues and strategies in heap management and memory hierarchiesby: Paul R. Wilson v. 26 i. 3 p. 45 - 52
- Software metrics, measurement theory, and viewpointsby: Erhard Konrad v. 26 i. 3 p. 53 - 62
- On the object-orientedness of C++by: Chung-Shyan Liu v. 26 i. 3 p. 63 - 67
- Exploiting multi-way branching to boost superscalar processor performanceby: Yen-Jen Oyang v. 26 i. 3 p. 68 - 78
- Top-down parsing in Coco-2by: Heinz Dobler v. 26 i. 3 p. 79 - 87
- Why a two pass front end?by: Janice C. Shepherd v. 26 i. 3 p. 88 - 94
- Reply to: Erhard Konrad - Software Metrics, Measurement Theory, and Viewpoints - Critical Remarks on a New Approachby: Horst Zuse, Peter Bollmann v. 26 i. 5 p. 27 - 36
- Trip Report: UIST '90, The Annual Symposium on User Interface Software and Technologyby: Ellis S. Cohen v. 26 i. 5 p. 37 - 42
- Two Models For Integrating Persistence and Lazy Functional Languagesby: David J. McNally, Antony J. T. Davie v. 26 i. 5 p. 43 - 52
- An Algorithmic Language for Database Operationsby: G. L. Sickerman v. 26 i. 5 p. 53 - 58
- Substring Parsing for Arbitrary Context-Free Grammarsby: J. Rekers, Wilco Koorn v. 26 i. 5 p. 59 - 66
- System validation via constraint modelingby: Richard C. Waters v. 26 i. 8 p. 27 - 36
- Another defence of enumerated typesby: Markku Sakkinen v. 26 i. 8 p. 37 - 41
- The IL programming languageby: Randy M. Kaplan v. 26 i. 8 p. 42 - 49
- A comprehensive analytical model for garbage collection algorithmsby: Jürgen Heymann v. 26 i. 8 p. 50 - 59
- CL/TB an allegro common Lisp programming interface for TransBaseby: Johann Kempe, T. Lenz, Burkhard Freitag, Heribert Schütz, Günther Specht v. 26 i. 8 p. 60 - 69
- Multiple view programming languagesby: Charles Fiterman v. 26 i. 8 p. 70 - 73
- Type-safe linkage for variables and functionsby: Diomidis Spinellis v. 26 i. 8 p. 74 - 79
- A cellular automata simulation systemby: J. Dana Eckart v. 26 i. 8 p. 80 - 85
- Thoughts on large scale programming projectsby: Robert McLaughlin v. 26 i. 8 p. 86 - 89
- Lucinda - an overviewby: Paul Butcher, Hussein Zedan v. 26 i. 8 p. 90 - 100
- Reflection facilities and realistic programmingby: Yutaka Ishikawa v. 26 i. 8 p. 101 - 110
- Semantic correctness of structural editingby: Tadeusz Gruzlewski, Zbigniew Weiss v. 26 i. 8 p. 111 - 120
- Detection of version features in distributed systemsby: K. C. Wong v. 26 i. 8 p. 121 - 127
- A browsing interface for S-expressionsby: Kei Yuasa v. 26 i. 8 p. 128 - 136
- Reliance on correlation data for complexity metric use and validationby: Stephen G. MacDonell v. 26 i. 8 p. 137 - 144
- Shallow binding makes functional arrays fastby: Henry G. Baker v. 26 i. 8 p. 145 - 147
- A theory of organizationby: Hermann von Issendorff v. 26 i. 8 p. 148 - 150
- Garbage-further investigationsby: G. Alan Creak v. 26 i. 10 p. 9 - 10
- Objects concepts and bibliographyby: Haim Kilov v. 26 i. 10 p. 11 - 12
- Function preconditions in object oriented softwareby: Jean Pierre LeJacq v. 26 i. 10 p. 13 - 18
- Compile-time transformations and optimization of parallel Divide-and-Conquer algorithmsby: Bruno Carpentieri, Z. George Mou v. 26 i. 10 p. 19 - 28
- A retargetable compiler for ANSI Cby: Christopher W. Fraser v. 26 i. 10 p. 29 - 43
- C++'s destructors can be destructiveby: L. S. Tang v. 26 i. 10 p. 44 - 52
- SNOOPS: An object-oriented language enhancement supporting dynamic program reconfigurationby: Noel G. Craske v. 26 i. 10 p. 53 - 63
- Concurrency & object-oriented programmingby: Michael L. Nelson v. 26 i. 10 p. 63 - 72
- Compiler structure engineering with attribute grammarsby: Ilka Miloucheva, Hans Loeper v. 26 i. 10 p. 73 - 82
- Which model of programming for LISP: sequential, functional or mixed?by: Chung-Kwong Yuen v. 26 i. 10 p. 83 - 92
- Bugfind: A Tool for Debugging Optimizing Compilersby: Jacqueline M. Caron, Peter A. Darnell v. 25 i. 1 p. 17 - 22
- Compiler Design for Sets in PASCALby: S. Srinivasan v. 25 i. 1 p. 23 - 24
- A Heretical View on Type Embeddingby: Raymond T. Boute v. 25 i. 1 p. 25 - 28
- Treating Failure As Valueby: Limsoon Wong, Beng Chin Ooi v. 25 i. 1 p. 29 - 32
- Survey and Comparison of PARLOG and Concurrent Prologby: Domenico Talia v. 25 i. 1 p. 33 - 42
- A Generative Approach to Universal Cross Assembler Designby: Peter P. K. Chiu, Sammy T. K. Fu v. 25 i. 1 p. 43 - 51
- FWEB: A Literate Programming System for Fortran8xby: Adrian Avenarius, Siegfried Oppermann v. 25 i. 1 p. 52 - 58
- Proposal for a Language Compatible Arithmetic Standardby: Mary Payne, Craig Schaffert, Brian A. Wichmann v. 25 i. 1 p. 59 - 86
- A Bibliography of Programming Styleby: Edward J. Thomas, Paul W. Oman v. 25 i. 2 p. 7 - 16
- Threading Lispby: David J. Nordstrom v. 25 i. 2 p. 17 - 24
- Toward Integration of the Imperative and Logic Programming Paradigms: Horn-Clause Programming in the Pascal Environmentby: Atanas Radensky v. 25 i. 2 p. 25 - 34
- Software Metrics - An Experimental Analysisby: B. Mehndiratta, P. S. Grover v. 25 i. 2 p. 35 - 41
- Interactors: A Real-Time Executive with Multiparty Interactions in C++by: Pierre Labrèche, Louis Lamarche v. 25 i. 4 p. 20 - 32
- The Static Semantics Fileby: Brian L. Meek v. 25 i. 4 p. 33 - 42
- Proposal for a Categorical Programming Languageby: Ronald E. Prather v. 25 i. 4 p. 43 - 50
- How to Build LR Parsers Which Accept Incomplete Inputby: Gregor Snelting v. 25 i. 4 p. 51 - 58
- Comparative Efficiency of General and Residual Parsersby: Frank G. Pagan v. 25 i. 4 p. 59 - 68
- Imperative versus Functionalby: Ryan Stansifer v. 25 i. 4 p. 69 - 72
- On "Power Loop" Constructs in Programming Languagesby: Robert Mandl v. 25 i. 4 p. 73 - 82
- From Recursive Ascent to Recursive Descent: Via Compiler Optimizationsby: George H. Roberts v. 25 i. 4 p. 83 - 89
- Orca: a language for distributed programmingby: Henri E. Bal v. 25 i. 5 p. 17 - 24
- Identifiers and static name abstractionby: Mark B. Wells v. 25 i. 5 p. 25 - 28
- Primitive string transformations as reductions to normal formby: Michael P. Barnett v. 25 i. 5 p. 29 - 33
- Infix to prefix conversion as a PST reductionby: Michael P. Barnett, Xu Rui v. 25 i. 5 p. 34 - 38
- Diverse executable semantics definitions in NUSL and an implementation of functional typesby: XinJie Jiang, YongSen Xu v. 25 i. 5 p. 39 - 52
- P-code and compiler portability: experience with a Modula-2 optimizing compilerby: Kenneth C. Louden v. 25 i. 5 p. 53 - 59
- Are constructive formal specifications less abstract?by: Ivo Van Horebeek, Johan Lewi v. 25 i. 5 p. 60 - 68
- Translation of nested Pascal routines to Cby: Neelakantan Sundaresan v. 25 i. 5 p. 69 - 81
- Coco-2: a new compiler compilerby: Heinz Dobler, Klaus Pirklbauer v. 25 i. 5 p. 82 - 90
- Generating the minimal model in Prologby: Klaus Kaiser v. 25 i. 5 p. 91 - 94
- A guide to natural namingby: Daniel Keller v. 25 i. 5 p. 95 - 102
- The use of sets as an application programming techniqueby: Peter L. Treadway v. 25 i. 5 p. 103 - 116
- On the modification of the formal grammar at parse timeby: Boris Burshteyn v. 25 i. 5 p. 117 - 123
- Synapse: a small and expressibe object-based real-time programming languageby: Michel De Champlain v. 25 i. 5 p. 124 - 134
- A correct example of multiple inheritanceby: Mikael Eriksson v. 25 i. 7 p. 7 - 10
- A concept for functional programming and distributed data processing in a local area network and its implementationby: Tzvetan T. Drashansky v. 25 i. 7 p. 11 - 18
- Programming without enumerations in Oberonby: Charles Lins v. 25 i. 7 p. 19 - 27
- Orthogonal type extensions and reductionsby: Jukka Paakki, Anssi Karhinen, Tomi Silander v. 25 i. 7 p. 28 - 38
- A self interpreter for BaLinda Lispby: Chung-Kwong Yuen, Weng-Fai Wong v. 25 i. 7 p. 39 - 58
- Bagof/3 to ZF expression: an example prolog application manually translated to Mirandaby: Peter Greenfield v. 25 i. 7 p. 59 - 62
- Prolog in "C"by: Joanne L. Boyd, Gerald M. Karam v. 25 i. 7 p. 63 - 71
- An elementary language construct for parallel programmingby: Tom Axford v. 25 i. 7 p. 72 - 80
- The programming languages REC and convertby: Harold V. McIntosh, Gerardo Cisneros v. 25 i. 7 p. 81 - 94
- On embedding Boolean as a subtype of integerby: Markku Sakkinen v. 25 i. 7 p. 95 - 96
- A brief survey of papers on scheduling for pipelined processorsby: Sanjay M. Krishnamurthy v. 25 i. 7 p. 97 - 106
- An annotated bibliography of software matricesby: Darrel C. Ince v. 25 i. 8 p. 15 - 23
- Treating failure as stateby: Limsoon Wong, Beng Chin Ooi v. 25 i. 8 p. 24 - 26
- Concurrent programming in Smalltalk-80by: Robert Steigerwald, Michael L. Nelson v. 25 i. 8 p. 27 - 36
- Automated compiler construction based on top-down syntax analysis and attribute evaluationby: W. F. Elsworth, M. B. A. Parkes v. 25 i. 8 p. 37 - 42
- Coupling FORTH and GKS in monitoring processesby: Vitaliano Milanese v. 25 i. 8 p. 43 - 52
- EVA: an explicit vector languageby: Jean-Luc Dekeyser, Philippe Marquet, Ph. Pruex v. 25 i. 8 p. 53 - 71
- Compiler textbook bibliographies considered harmfulby: Victor B. Schneider v. 25 i. 8 p. 72 - 74
- Two-valued datatypesby: Brian L. Meek v. 25 i. 8 p. 75 - 79
- Failure is not just one valueby: Brian L. Meek v. 25 i. 8 p. 80 - 83
- A theory of organizationby: Hermann von Issendorff v. 25 i. 8 p. 84 - 102
- Adverbial programmingby: Michael J. A. Berry v. 25 i. 8 p. 103 - 105
- The flow of control notations pancode and boxchartsby: Dan Jonsson v. 25 i. 8 p. 106 - 119
- VisiCLANG - a visible compiler for CLANGby: R. Daniel Resler, Keith O'Sullivan v. 25 i. 8 p. 120 - 123
- Dynamical system specifications as validation mediaby: József Györkös, Ivan Rozman, Tatjana Welzer v. 25 i. 9 p. 10 - 16
- Notes on termination of OCCAM processesby: Domenico Talia v. 25 i. 9 p. 17 - 24
- Communication typesby: Charles Chul-Doo Jung, Ernest E. Sibert v. 25 i. 9 p. 25 - 30
- A theory of organizationby: Hermann von Issendorff v. 25 i. 9 p. 31 - 38
- Language support for a semi-dataflow parallel programming environmentby: A. B. Ruighaver, T. T. E. Yeo v. 25 i. 9 p. 39 - 47
- A survey of adaptable grammarsby: Henning Christiansen v. 25 i. 11 p. 35 - 44
- Ellie language definition reportby: Birger Andersen v. 25 i. 11 p. 45 - 64
- Involving coroutines in interaction between functional and conventional languageby: Mirjana Ivanovic, Zoran Budimac v. 25 i. 11 p. 65 - 74
- A plea for a readable Prolog programming styleby: Robert McLaughlin v. 25 i. 11 p. 75 - 79
- A conservative alternative to pancodeby: Thomas A. Kovats v. 25 i. 11 p. 80 - 84
- Functional programming in a parallel environment: the implementation of FP in MDCby: Thomas W. Christopher, David K. Ameiss v. 25 i. 11 p. 85 - 94
- A database design for graphical modelsby: Susi Dulli, Vitaliano Milanese v. 25 i. 12 p. 30 - 36
- O.LISP: theoretical basis and descriptionby: Choun Tong Lieu, Djamil Sarni v. 25 i. 12 p. 37 - 44
- Generation and recognition of formal languages by modifiable grammarsby: Boris Burshteyn v. 25 i. 12 p. 45 - 53
- A prolog space benchmark suite: a new tool to compare prolog implementationsby: Klaus Bothe v. 25 i. 12 p. 54 - 60
- Programming language RIGAL as a compiler writing toolby: Mikhail Auguston v. 25 i. 12 p. 61 - 69
- Eiffel Linda: an object-oriented Linda dialectby: Robert Jellinghaus v. 25 i. 12 p. 70 - 84
- Does Modula-2 generate racehorses?: comparison of compiler generated code quality for floating point arithmeticby: Günter Dotzel v. 25 i. 12 p. 85 - 88
- Universal editor unattainableby: C. S. Yovev v. 25 i. 12 p. 89 - 92
- Preliminary ideas of a conceptual programming languageby: ChengXiang Zhai v. 25 i. 12 p. 93 - 100
- Comments on Oberonby: A. J. E. van Delft v. 24 i. 3 p. 23 - 30
- AUTO STAR - a software development systemby: Ming-Yuan Zhu v. 24 i. 3 p. 31 - 45
- Formalization of the control stackby: J. Ángel Velázquez-Iturbide v. 24 i. 3 p. 46 - 54
- How to best return the value of a functionby: Markku Sakkinen v. 24 i. 3 p. 55 - 56
- NARPL: A solution to the student compiler project problemby: Kevin Atteson, Michael Lorenz, William F. Dowling v. 24 i. 3 p. 57 - 66
- Formulations and benefits of the law of demeterby: Karl J. Lieberherr, Ian M. Holland v. 24 i. 3 p. 67 - 78
- Comments, assertions and pragmasby: Peter Grogono v. 24 i. 3 p. 79 - 84
- Next: the elimination of Goto-patches?by: Dan Jonsson v. 24 i. 3 p. 85 - 92
- Draft report on requirements for a common prototyping systemby: Richard P. Gabriel v. 24 i. 3 p. 93 - 165
- Design of a distributed implementation of ABCL/Iby: Jean-Pierre Briot, J. de Ratuld v. 24 i. 4 p. 15 - 17
- Adding concurrency to a statically type-safe object-oriented programming languageby: Peter A. Buhr, Glen Ditchfield, C. Robert Zarnke v. 24 i. 4 p. 18 - 21
- A model for a reflective object-oriented languageby: Yves Caseau v. 24 i. 4 p. 22 - 24
- A uniform object model for parallel programmingby: Lawrence A. Crowl v. 24 i. 4 p. 25 - 27
- Object-oriented concurrent programming in CSTby: William J. Dally, Andrew A. Chien v. 24 i. 4 p. 28 - 31
- Taking concurrency seriously (position paper)by: Maurice Herlihy v. 24 i. 4 p. 32 - 33
- Process oriented programmingby: Boris Magnusson v. 24 i. 4 p. 34 - 36
- Concurrent objects in a logic programming frameworkby: Paola Mello v. 24 i. 4 p. 37 - 39
- Concurrent object access in BLAZE 2by: Piyush Mehrotra, John Van Rosendale v. 24 i. 4 p. 40 - 42
- Distributed concurrent smalltalk: a language and system for the interpersonal environmentby: T. Nakajima, Yasuhiko Yokote, Mario Tokoro, S. Ochiai, T. Nagamatsu v. 24 i. 4 p. 43 - 45
- Granularity of modules in object-based concurrent systemsby: Peter Wegner v. 24 i. 4 p. 46 - 49
- An introduction to object-based reflective concurrent computationby: Akinori Yonezawa, Takuo Watanabe v. 24 i. 4 p. 50 - 54
- Foundational issues in concurrent computingby: Gul Agha v. 24 i. 4 p. 60 - 65
- Cantor: an actor programming system for scientific computingby: William C. Athas, Nanette J. Boden v. 24 i. 4 p. 66 - 68
- From objects to actors: study of a limited symbiosis in smalltalk-80by: Jean-Pierre Briot v. 24 i. 4 p. 69 - 72
- Object oriented languages and actors: which language for a distributed approach?by: F. Carre, P. Clere v. 24 i. 4 p. 73 - 75
- Message driven computing and its relationship to actorsby: Thomas W. Christopher v. 24 i. 4 p. 76 - 78
- Concurrent data structures and actor programming under the Matroshka modelby: Lawrence A. Crowl v. 24 i. 4 p. 79 - 80
- Plasma-II: an actor approach to concurrent programmingby: G. Lapaime, Patrick Sallé v. 24 i. 4 p. 81 - 83
- A peek at Acore, an actor core languageby: Carl Manning v. 24 i. 4 p. 84 - 86
- Actra-a multitasking/multiprocessing smalltalkby: Dave A. Thomas, Jeff McAffer, Brian M. Barry v. 24 i. 4 p. 87 - 90
- Rosette: An object-oriented concurrent systems architectureby: Chris Tomlinson, Won Kim, Mark Scheevel, Vineet Singh, B. Will, Gul Agha v. 24 i. 4 p. 91 - 93
- Indexed, global objects for distributed memory parallel architecturesby: William L. Bain v. 24 i. 4 p. 95 - 98
- MITRE's future generation computer architectures programby: Edward H. Bensley, Thomas J. Brando, J. C. Fohlin, Myra Jean Prelle, Ann Wollrath v. 24 i. 4 p. 99 - 101
- A general model for concurrent and distributed object-oriented programmingby: Denis Caromel v. 24 i. 4 p. 102 - 104
- A synchronization mechanism for typed objects in a distributed systemby: Dominique Decouchant, Sacha Krakowiak, M. Meysembourg, Michel Riveill, Xavier Rousset de Pina v. 24 i. 4 p. 105 - 107
- MACE: High-level distributed objects in a flexible testbed for distributed AI researchby: Les Gasser v. 24 i. 4 p. 108 - 110
- Extensions to the object paradigm for the development of distributed applicationsby: Lutz Heuser, Alexander Schill, Max Mühlhäuser v. 24 i. 4 p. 111 - 113
- An object-oriented programming language for distributed systems: Heraklitby: Bernd Hindel v. 24 i. 4 p. 114 - 116
- Objects for distributed systemsby: Mehdi Jazayeri v. 24 i. 4 p. 117 - 119
- Concurrent meldby: Gail E. Kaiser v. 24 i. 4 p. 120 - 122
- Parallel objects on distributed constraint logic programming machinesby: John F. Koegel v. 24 i. 4 p. 123 - 125
- Intent: an integrated environment for distributed heterogeneous databasesby: Mike P. Papazoglou, Janis A. Bubenko Jr., Moira C. Norrie v. 24 i. 4 p. 126 - 128
- Combining object-oriented techniques with data-driven parallel execution on message passing, MIMD computersby: E. J. Segall v. 24 i. 4 p. 129 - 131
- Linearizable concurrent objectsby: Maurice Herlihy, Jeannette M. Wing v. 24 i. 4 p. 133 - 135
- Transactions for concurrent object-oriented programming systemsby: Gail E. Kaiser v. 24 i. 4 p. 136 - 138
- Evaluating correctness criteria for transactionsby: David E. Langworthy v. 24 i. 4 p. 139 - 141
- Concurrent programming vs. concurrency control: shared events or shared databy: Bruce Martin v. 24 i. 4 p. 142 - 144
- Concurrency control for cooperating transactions in an object-oriented databaseby: Andrea H. Skarra v. 24 i. 4 p. 145 - 147
- PROCOL: a protocol-constrained concurrent object-oriented languageby: Jan van den Bos v. 24 i. 4 p. 149 - 151
- PO: an object model to express parallelismby: Antonio Corradi, Letizia Leonardi v. 24 i. 4 p. 152 - 155
- Modeling the semantics of smalltalk-80 with Petri netsby: Dimitris Christodoulakis v. 24 i. 4 p. 156 - 158
- Language issues in the specification and design of composite systemsby: Martin S. Feather v. 24 i. 4 p. 159 - 161
- Specifying concurrent objectsby: Bernd J. Krämer v. 24 i. 4 p. 162 - 164
- The heart of object-oriented concurrent programmingby: J. Lim, Ralph E. Johnson v. 24 i. 4 p. 165 - 167
- Concurrent behaviorsby: Shang Lujun, F. Changpeng, X. Lihul v. 24 i. 4 p. 168 - 170
- Position statement on concurrent objects for massively parallel architecturesby: A. Luke, H. C. Takacs, W. C. Welch v. 24 i. 4 p. 171 - 173
- Two models of concurrent objectsby: Oscar Nierstrasz v. 24 i. 4 p. 174 - 176
- Transformation of concurrent object systemsby: Etsuya Shibayama v. 24 i. 4 p. 177 - 179
- Program design visualization system for object-oriented programsby: I. Ichikawa, Seiichi Aikawa, Mayumi Kamiko, E. Ono, T. Mohri v. 24 i. 4 p. 181 - 183
- Garp: a graphical/textual language for concurrent programmingby: Simon M. Kaplan, Steven K. Goering v. 24 i. 4 p. 184 - 186
- Sarek: a window system interface for object-oriented concurrent programming languagesby: Minoru Uehara, Chisato Numaoka, Yasuhiko Yokote, Mario Tokoro v. 24 i. 4 p. 187 - 189
- Analyzing patterns of message passingby: C. R. Ball, Theodore W. Leung, Carl A. Waldspurger v. 24 i. 4 p. 191 - 193
- Elint in Lamina: application of a concurrent object languageby: Bruce Delagi, Nakul P. Saraiya v. 24 i. 4 p. 194 - 196
- The Ubik configurator: A fusion of messages, daemons, and rulesby: Peter de Jong v. 24 i. 4 p. 197 - 199
- An object-based parallel programming assistantby: Ebba Thora Hvannberg, M. S. Krishnamoorthy v. 24 i. 4 p. 200 - 202
- Concurrent object-oriented real-times systems researchby: Dennis G. Kafura v. 24 i. 4 p. 203 - 205
- Felix, an object-oriented operating systemby: M. Lester, R. Christensen v. 24 i. 4 p. 206 - 208
- Harmony as an object-oriented operating systemby: Stephen A. MacKay, W. Morven Gentleman, D. A. Stewart v. 24 i. 4 p. 209 - 211
- Object-based real-time programmingby: Libero Nigro, Francesco Tisato v. 24 i. 4 p. 212 - 214
- Using spreadsheet software to support metric's life cycle activitiesby: Peter Kokol v. 24 i. 5 p. 27 - 37
- A simple bucket-brigade advancement mechanism for generation-bases garbage collectionby: Paul R. Wilson v. 24 i. 5 p. 38 - 46
- Portable IPC on Vanilla Unixby: Mark Rain v. 24 i. 5 p. 47 - 56
- Quality assessment of processor documentationby: Collette Green, Brian L. Meek, K. K. Siu v. 24 i. 5 p. 57 - 65
- Automating commentsby: Pierre N. Robillard v. 24 i. 5 p. 66 - 70
- SLD: a folk acronym?by: Graem A. Ringwood v. 24 i. 5 p. 71 - 75
- On prolog and the occur check problemby: Kim Marriott, Harald Søndergaard v. 24 i. 5 p. 76 - 82
- Fourth generation problemsby: Rommert J. Casimir v. 24 i. 5 p. 83 - 86
- A "card-marking" scheme for controlling intergenerational references in generation-based garbage collection on stock hardwareby: Paul R. Wilson, Thomas G. Moher v. 24 i. 5 p. 87 - 92
- A translator from Small Euclid to Pascalby: Panayiotis E. Pintelas, K. P. Ventouris, M. D. Papassimakopoulou v. 24 i. 5 p. 93 - 101
- A language-based design for portable data filesby: Carl Burch v. 24 i. 5 p. 102 - 111
- A comparison of extended pascal and Adaby: Jane Donaho v. 24 i. 5 p. 112 - 120
- Joyce: an object-oriented decision tree builderby: Bob Marcus v. 24 i. 5 p. 121 - 123
- A case against using procedure calls for input/outputby: Ronald Fischer v. 24 i. 5 p. 124 - 127
- A better way to combine efficient string length encoding and zero-terminationby: Coenraad Bron, Edsger W. Dijkstra v. 24 i. 6 p. 11 - 19
- Scientific processing in ISO-Pascal: a proposal to get the benefits of mixed precision floating-pointby: Brian A. Wichmann v. 24 i. 6 p. 20 - 22
- A note on the detection of an Ada compiler bug while debugging an Anna programby: Sriram Sankar v. 24 i. 6 p. 23 - 31
- Modified structured decision table and its complexityby: A. K. Misra, B. D. Chaudhary v. 24 i. 6 p. 32 - 34
- Procedure parameters can imitate sequence concatenationby: Keith McC. Clarke v. 24 i. 6 p. 35 - 36
- Managing C++ librariesby: James M. Coggins, Gregory Bollella v. 24 i. 6 p. 37 - 48
- Handling ambiguous tokens in LR-Parsersby: James Kanze v. 24 i. 6 p. 49 - 54
- Extended Pascal is no problemby: Jon Mauney v. 24 i. 6 p. 55 - 58
- Definition of the DISC concurrent languageby: Giulio Iannello, Antonino Mazzeo, Giorgio Ventre v. 24 i. 6 p. 59 - 68
- Developments in Pascal-FCby: Gordon Davies v. 24 i. 6 p. 69 - 76
- Extended Pascal - numerical featuresby: David A. Joslin v. 24 i. 6 p. 77 - 80
- The effectiveness of error seedingby: Brian L. Meek, K. K. Siu v. 24 i. 6 p. 81 - 89
- An improved mixture rule for pattern matchingby: John Ophel v. 24 i. 6 p. 91 - 96
- Regular attribute grammars and finite state machinesby: Nigel P. Chapman v. 24 i. 6 p. 97 - 105
- Rated and operating complexity of program - an extension to McCabe's theory of complexity measureby: Mohommedyusuf M. Sagri v. 24 i. 8 p. 8 - 12
- Hypercube experiments with Joyceby: Birger Andersen v. 24 i. 8 p. 13 - 22
- Software metrics: using measurement theory to describe the properties and scales of static software complexity metricsby: Horst Zuse, Peter Bollmann v. 24 i. 8 p. 23 - 33
- A case for using procedure calls for I/Oby: William A. Baldwin v. 24 i. 8 p. 34 - 36
- Aspects of OBERON suitable for graphics applicationsby: Vitaliano Milanese v. 24 i. 8 p. 37 - 45
- A portable high-speed PASCAL to C Translatorby: Klaus Bothe, B. Hohberg, Christian Horn, O. Wikarski v. 24 i. 9 p. 60 - 65
- SN-2: a data acquisition and processing systemby: Defu Zhang, Yang Peigen, Sun Zhongxiu v. 24 i. 9 p. 66 - 71
- XE design rationale: Clu revisitedby: Vesa Hirvisalo, Jari Arkko, Juha Kuusela, Esko Nuutila, Markku Tamminen v. 24 i. 9 p. 72 - 79
- Implementing a graph-colouring algorithm in Parlogby: Matthew M. Huntbach v. 24 i. 9 p. 80 - 85
- A three-processor Lisp machine architecture based on statistical analysis of Common Lisp programsby: Arno J. Klaassen, Anton M. van Wezenbeek v. 24 i. 9 p. 86 - 91
- Transformational programming: the derivation of a Prolog interpretation algorithmby: Ming-Yuan Zhu v. 24 i. 9 p. 92 - 111
- A practical example of multiple inheritance in C++by: Richard Wiener, Lewis J. Pinson v. 24 i. 9 p. 112 - 115
- A prototype intelligent prettyprinter for Pascalby: Kirt A. Winter, Curtis R. Cook v. 24 i. 9 p. 116 - 125
- Indirect naming in distributed programming languagesby: Chul-Doo Jung, Ernest Sibert v. 24 i. 9 p. 126 - 132
- Procedural objects in Newtonby: Charles Rapin v. 24 i. 9 p. 133 - 141
- Application programming as the construction of language interpretersby: Richard A. Frost v. 24 i. 9 p. 142 - 151
- The Alonzo functional programming languageby: John D. Ramsdell v. 24 i. 9 p. 152 - 157
- Critical research directions in programming languagesv. 24 i. 11 p. 10 - 24
- The syntax definition formalism SDF - reference manualby: Jan Heering, P. R. H. Hendriks, Paul Klint, J. Rekers v. 24 i. 11 p. 43 - 75
- Random number generators are chaoticby: Charles Herring, Julian I. Palmore v. 24 i. 11 p. 76 - 79
- Corrections to the paper: Scannerless NSLR(1) Parsing of Programming Languagesby: Daniel J. Salomon, Gordon V. Cormack v. 24 i. 11 p. 80 - 83
- Recursive Pattern Matching on concrete data typesby: Pierre Jouvelot, Babak Dehbonei v. 24 i. 11 p. 84 - 93
- Shift-reduce conflicts in LR parsersby: Stylianos D. Pezaris v. 24 i. 11 p. 94 - 95
- Object Oriented Programmingby: Bhanu Prasad Pokkunuri v. 24 i. 11 p. 96 - 101
- A note on the Power Operators "loops are harmful"by: Joseph de Kerf v. 24 i. 11 p. 102 - 108
- Polymorphism and type checking in object-oriented languagesby: Peter Grogono, Anne Bennett v. 24 i. 11 p. 109 - 115
- Programming interactively with a graphical abstract programming languageby: Miren Begoña Albizuri-Romero v. 24 i. 11 p. 116 - 124
- The design of very fast portable compilersby: Andrew S. Tanenbaum, M. Frans Kaashoek, Koen Langendoen, Ceriel J. H. Jacobs v. 24 i. 11 p. 125 - 131
- A useful extension to Prolog's definite clause grammar notationby: Peter Van Roy v. 24 i. 11 p. 132 - 134
- Pancode assessedby: Dan Jonsson v. 24 i. 12 p. 17 - 20
- An anomaly found during the implementation of a 2-dimensional dataflow editor for constructing dataflow graphs in NAKL: not another keypunch languageby: Stephen M. Nemecek v. 24 i. 12 p. 21 - 23
- Io: a new programming notationby: Raphael L. Levien v. 24 i. 12 p. 24 - 31
- An example of multiple inheritance in C++: a model of the lostream libraryby: Jonathan E. Shopiro v. 24 i. 12 p. 32 - 36
- Common Lisp Object System Specification X2JI3 Document 88-002Rby: Daniel G. Bobrow, Linda G. DeMichiel, Richard P. Gabriel, Sonya E. Keene, Gregor Kiczales, David A. Moon v. 23 i. Special Issue p. 1 - 2
- Workshop on object-oriented programming ECOOP 1987, Paris, June 18, 1987by: Peter Wegner v. 23 i. 1 p. 16 - 37
- A reply to "A note on metrics of Pascal programs"by: Victor B. Schneider v. 23 i. 1 p. 38 - 39
- Approximations for the Halstead software science software error rate and project effort estimatorsby: Victor B. Schneider v. 23 i. 1 p. 40 - 47
- Data flow analysis of recursive proceduresby: P. Fairfield, Michael A. Hennell v. 23 i. 1 p. 48 - 57
- Pascal-FC: a language for teaching concurrent programmingby: Alan Burns, Gordon Davies v. 23 i. 1 p. 58 - 66
- A functional program for the fast Fourier transformby: Fer-Jan de Vries v. 23 i. 1 p. 67 - 74
- A standard for a graph representation for functional programsby: Mike Joy, Tom Axford v. 23 i. 1 p. 75 - 82
- Denotational semantics for program analysisby: Shan-Jon Chao, Barrett R. Bryant v. 23 i. 1 p. 83 - 91
- Implementation of an optimizing compiler for VHDLby: Jayaram Bhasker v. 23 i. 1 p. 92 - 108
- Four relational programsby: Bruce J. MacLennan v. 23 i. 1 p. 109 - 119
- Remarks on many-sorted equational logic with respect to algebraic implementationsby: Eric van Gestel, Ivo van Horebeek v. 23 i. 1 p. 120 - 126
- MS-DOS Prolog implementations revisitedby: Hal Berghel, Richard Rankin, Sanjiv K. Bhatia v. 23 i. 1 p. 127 - 134
- A proposal for improving optimizer quality via dynamic analysisby: Keith H. Bierman v. 23 i. 1 p. 135 - 136
- Turing Plus: a comparison with C and Pascalby: Stephen G. Perelgut, James R. Cordy v. 23 i. 1 p. 137 - 143
- C++ versus LISP: a case studyby: Howard Trickey v. 23 i. 2 p. 9 - 18
- A bibliography on partial evaluationby: Peter Sestoft, Harald Søndergaard v. 23 i. 2 p. 19 - 26
- In search of program complexityby: P. F. Sorensen v. 23 i. 2 p. 28 - 35
- A model for procedures passed as parametersby: Graham M. Birtwistle, Kenneth D. Loose v. 23 i. 2 p. 36 - 43
- Benchmark semanticsby: Carl Ponder v. 23 i. 2 p. 44 - 48
- Unfair process scheduling in Modula-2by: David Hemmendinger v. 23 i. 3 p. 7 - 12
- Problems with automatic restructurersby: Frank W. Calliss v. 23 i. 3 p. 13 - 21
- A precompiler for modular, transportable Pascalby: Max J. Egenhofer, Andrew U. Frank v. 23 i. 3 p. 22 - 32
- Automatic construction of incremental LR(1)-parsersby: Dashing Yeh, Uwe Kastens v. 23 i. 3 p. 33 - 42
- Towards functional programming in Prologby: Antonio L. Furtado v. 23 i. 3 p. 43 - 52
- Responsive sequential processesby: Neelam Soundararajan, Roger L. Costello v. 23 i. 3 p. 53 - 62
- A new benchmark test to estimate optimization quality of compilersby: Melvin Klerer, Hong Liu v. 23 i. 3 p. 63 - 72
- What does Modular-2 need to fully support object oriented programming?by: Joseph Bergin, Stuart Greenfield v. 23 i. 3 p. 73 - 82
- Using formal procedure parameters to represent and transmit complex data structuresby: Niklas Holsti v. 23 i. 3 p. 83 - 92
- Determining path feasibility for commercial programsby: P. David Coward v. 23 i. 3 p. 93 - 101
- Process migration: effects on scientific computationby: Gerald Q. Maguire Jr., Jonathan M. Smith v. 23 i. 3 p. 102 - 106
- Some comments on the forthcoming "extended Pascal" standardby: Phillippe Ranger v. 23 i. 3 p. 107 - 110
- Comment on dpANS X3.160-198x, extended Pascal concerning the initial value clauseby: Mark Molloy v. 23 i. 4 p. 22 - 26
- Bindings persistent programming languagesby: Ronald Morrison, Malcolm P. Atkinson, Alfred L. Brown, Alan Dearle v. 23 i. 4 p. 27 - 34
- Efficient computation of flow-insensitive interprocedural summary information - a correctionby: Keith D. Cooper, Ken Kennedy v. 23 i. 4 p. 35 - 42
- Visual programming languages: the next generationby: Alistair D. N. Edwards v. 23 i. 4 p. 43 - 50
- The role of the language standards committeeby: Neil W. Rickert v. 23 i. 4 p. 51 - 55
- Incremental execution environmentby: M. A. Bhatti v. 23 i. 4 p. 56 - 64
- Implementing functional languages on a combinator-based reduction machineby: S. Mansoor Sarwar, S. J. Hahn, J. A. Davis v. 23 i. 4 p. 65 - 70
- Concurrent programming language - LISPTALKby: Chang Li v. 23 i. 4 p. 71 - 80
- The "Hamming problem" in Prologby: David Hemmendinger v. 23 i. 4 p. 81 - 86
- A common-LISP implementation of an extended Prolog systemby: Giuseppe Cattaneo, Vincenzo Loia v. 23 i. 4 p. 87 - 102
- Please: a language combining imperative and logic programmingby: Robert B. Terwilliger v. 23 i. 4 p. 103 - 110
- An abundance of registersby: P. E. Cohen v. 23 i. 6 p. 24 - 34
- A pedagogic expert system shell in Prologby: Victor B. Schneider v. 23 i. 6 p. 35 - 38
- The PRESTO systemby: Irving B. Elliott v. 23 i. 6 p. 39 - 48
- Simulating the object-oriented paradigm to Nialby: Philip J. Beaudet, Michael A. Jenkins v. 23 i. 6 p. 49 - 58
- Portability of softwareby: Hermann Kaindl v. 23 i. 6 p. 59 - 68
- Clarify function]by: N. Anand v. 23 i. 6 p. 69 - 79
- OPG: an optimizing parser generatorby: George H. Roberts v. 23 i. 6 p. 80 - 90
- Abstract data types with shared operationsby: Kasper Østerbye v. 23 i. 6 p. 91 - 96
- y+: A yacc preprocessor for certain semantic actionsby: Joseph C. H. Park v. 23 i. 6 p. 97 - 106
- PS-Algol's device-independent output statementby: Paul Philbrow, I. Armour, Malcolm P. Atkinson, J. Livingstone v. 23 i. 6 p. 107 - 114
- The `Hamming' in Prologby: David Hemmendinger v. 23 i. 6 p. 115 - 120
- Spreadsheet language level: how high is it?by: Peter Kokol v. 23 i. 6 p. 121 - 134
- Are applicative languages inefficient?by: Carl Ponder, Patrick C. McGeer, Anthony P.-C. Ng v. 23 i. 6 p. 135 - 139
- Regular right part programming languagesby: Barry Dwyer v. 23 i. 6 p. 140 - 144
- Adding an authorization dimension to strong type checkingby: Scott N. Gerard v. 23 i. 6 p. 145 - 151
- The frequency of dynamic pointer references in "C" programsby: Barton P. Miller v. 23 i. 6 p. 152 - 156
- Benchmark semanticsby: Carl Ponder v. 23 i. 6 p. 157 - 161
- How (not) to code a finite state machineby: Dougals W. Jones v. 23 i. 8 p. 19 - 22
- Recursive ascent: an LR analog to recursive descentby: George H. Roberts v. 23 i. 8 p. 23 - 29
- FLIC - a functional language intermediate codeby: Simon L. Peyton Jones v. 23 i. 8 p. 30 - 48
- Dhrystone benchmark: rationale for version 2 and measurement rulesby: Reinhold Weicker v. 23 i. 8 p. 49 - 62
- Tasking troubles and tipsby: Linda Rising v. 23 i. 8 p. 63 - 72
- A note on the speed of Prologby: Jukka Paakki v. 23 i. 8 p. 73 - 82
- New developments in Pascal-SCby: Gerd Bohlender, Christian P. Ullrich, Jürgen Wolff von Gudenberg v. 23 i. 8 p. 83 - 92
- The linked class of Modula-3by: E. Levy v. 23 i. 8 p. 93 - 102
- Resolving ambiguities in the parsing of translation grammarsby: M. Share v. 23 i. 8 p. 103 - 109
- A Modula-2 implementation of a real-time process abstractionby: Alan Burns, Gordon Davies, Andy J. Wellings v. 23 i. 10 p. 49 - 58
- Programming languages should NOT have comment statementsby: Michael J. Kaelbling v. 23 i. 10 p. 59 - 60
- Some sad remarks about string handling in Cby: Paul W. Abrahams v. 23 i. 10 p. 61 - 68
- Notes on what language maturity means, and how to measure itby: Jean E. Sammet v. 23 i. 10 p. 69 - 71
- Timing results of various compilers using an optimization quality benchmarkby: Hong Liu, Melvin Klerer v. 23 i. 10 p. 72 - 74
- Benchmark test to estimate optimization quality of compilersby: Melvin Klerer, Hong Liu v. 23 i. 10 p. 75 - 84
- Smalltalk and exploratory programmingby: David W. Sandberg v. 23 i. 10 p. 85 - 92
- Dynamic instantiation and configuration of functionally extended, efficient lexical analysersby: Peter Schnorf v. 23 i. 10 p. 93 - 102
- GRAMOLby: C. Genillard, Alfred Strohmeier v. 23 i. 10 p. 103 - 122
- An expert system for a retargetable peephole optimizerby: Jay W. Warfield, Henry R. Bauer III v. 23 i. 10 p. 123 - 130
- Dynamic programming and industrial-strength instruction selection: code generation by tiring, but not exhaustive, searchby: John S. Yates, Robert A. Schwartz v. 23 i. 10 p. 131 - 140
- An efficient algorithm for heap storage allocationby: Charles B. Weinstock, William A. Wulf v. 23 i. 10 p. 141 - 148
- PSAIL: A portable SAIL to C compiler - description and tutorialby: Peter F. Lemkin v. 23 i. 10 p. 149 - 171
- A fast algorithm for code movement optimisationby: Dhananjay M. Dhamdhere v. 23 i. 10 p. 172 - 180
- An integration of logic and object-oriented programmingby: Fred Mellender v. 23 i. 10 p. 181 - 185
- Grammars for FFPby: Joseph E. Lang v. 23 i. 10 p. 186 - 190
- The role of opaque types to build abstractionsby: Antonio Corradi, Letizia Leonardi v. 23 i. 12 p. 24 - 37
- Comments on "the law of demeter" and C++by: Markku Sakkinen v. 23 i. 12 p. 38 - 44
- Improvements of an incremental evaluation algorithm for ordered attribute grammarsby: Dashing Yeh, Uwe Kastens v. 23 i. 12 p. 45 - 50
- Asynchronous communication on Occamby: Nikola B. Serbedzija v. 23 i. 12 p. 51 - 62
- Time space tradeoffs in vector algorithms for APL functionsby: Timothy A. Budd v. 23 i. 12 p. 63 - 68
- A paradigm for programming style researchby: Paul W. Oman, Curtis R. Cook v. 23 i. 12 p. 69 - 78
- Portable software in modular Pascalby: Christian Neusius v. 23 i. 12 p. 79 - 85
- Iteration for applicative languagesby: Antonio L. Furtado, Paulo A. S. Veloso v. 23 i. 12 p. 86 - 94
- Process scheduling in Modula-2by: D. A. Sewry v. 23 i. 12 p. 95 - 97
- Opportunistic garbage collectionby: Paul R. Wilson v. 23 i. 12 p. 98 - 102
- A problem with extended Pascalby: Ronald T. House v. 23 i. 12 p. 103 - 114
- SOS: a monitor-based operating system for instructionby: David E. Boddy v. 23 i. 12 p. 115 - 124
- Adding regular expressions to Pascalby: Daniel Sharpe v. 23 i. 12 p. 125 - 133
- Language standards committees and revisionsby: Brian L. Meek v. 23 i. 12 p. 134 - 142
- Efficient full LR(I) parser generationby: David Spector v. 23 i. 12 p. 143 - 150
- Comments on innovative control constructs in pancode and EPNby: Thomas A. Kovats v. 23 i. 12 p. 151 - 157
- A Grammar Rule Notation Translatorby: James F. Watson v. 22 i. 4 p. 16 - 27
- A Note on the Modulo Operation in Edisonby: Gary A. Hill v. 22 i. 4 p. 28 - 29
- Remarks on Recent Algorithms for LALR Lookahead Setsby: Joseph C. H. Park, Kwang-Moo Choe v. 22 i. 4 p. 30 - 32
- Lazy Evaluation and Nondeterminism Make Backus' FP-Systems More Practicalby: Atanas Radensky v. 22 i. 4 p. 33 - 40
- Remarks on Remarks on Many-Sorted Equational Logicby: Joseph A. Goguen, José Meseguer v. 22 i. 4 p. 41 - 48
- Combinatory Code and a Parallel Packet Based Computational Modelby: Andrew Cheese v. 22 i. 4 p. 49 - 58
- A Notation For Specifying Menusby: S. Hekmatpour v. 22 i. 4 p. 59 - 62
- Puzzles, PROLOG amd Logicby: Thomas W. Jerardi v. 22 i. 4 p. 63 - 69
- OBJEKT: A Persistent Object Store With An Integrated Garbage Collectorby: David M. Harland, Bruno Beloff v. 22 i. 4 p. 70 - 79
- About the Semantic Nested Monitor Callsby: Leszek Kotulski v. 22 i. 4 p. 80 - 82
- Implementing an Access and Object Oriented Paradigm in a Language That Supports Neitherby: Rand Methfessel v. 22 i. 4 p. 83 - 93
- Programs Complexity: Comparative Analysis, Hierarchy, Classificationby: Ion Ivan, Romulus Arhire, Marian Macesanu v. 22 i. 4 p. 94 - 102
- Iteration and Abstract Data Typesby: J. Dana Eckart v. 22 i. 4 p. 103 - 110
- A Note on "Protecting Against Uninitialized Abstract Objects In Modula-2"by: Michael A. Torbett v. 22 i. 5 p. 8 - 10
- More Ambiguities and Insecurities in Modula-2by: Michael A. Torbett v. 22 i. 5 p. 11 - 17
- Extended Pascal - Illustrative Featuresby: David A. Joslin v. 22 i. 5 p. 18 - 19
- Multilevel EXIT and CYCLE aren't so badby: W. Van Snyder v. 22 i. 5 p. 20 - 22
- Is Ada an Object Oriented Programming Language?by: Hervé J. Touati v. 22 i. 5 p. 23 - 26
- A Note on H. E. Tomplin's Minimum-Period COBOL Styleby: Roger R. Baldwin v. 22 i. 5 p. 27 - 31
- A Software Science Counting Strategy for the Full Ada Languageby: Dennis M. Miller, James W. Howatt, Robert S. Maness, Wade H. Shaw Jr. v. 22 i. 5 p. 32 - 41
- Pascal Implementation of a LISP Interpreterby: Mario Mango Furnari v. 22 i. 5 p. 42 - 46
- Programming the Loral LDF 100 Dataflow Machineby: Ian Kaplan v. 22 i. 5 p. 47 - 57
- Uninitialized Modula-2 Abstract Object Instances, Yet Againby: Jon Bondy v. 22 i. 5 p. 58 - 63
- Logic and Databases: A Responseby: Hervé Gallaire, Jack Minker, Jean-Marie Nicolas v. 22 i. 6 p. 20 - 24
- A Modula-2 Implementation of CSPby: M. Collado, R. Morales, J. J. Moreno v. 22 i. 6 p. 25 - 38
- Prolog Dialects: a deja vu of BASICsby: Raymond A. Sosnowski v. 22 i. 6 p. 39 - 48
- Multi-Moded Relations in Parlogby: Andrew Cheese v. 22 i. 6 p. 49 - 51
- Detecting Uninitialized Modula-2 Abstract Objectsby: Stuart Greenfield, Roger Norton v. 22 i. 6 p. 52 - 58
- Object-Oriented Programming in C++ - A Case Studyby: Richard S. Wiener v. 22 i. 6 p. 59 - 68
- Support for Dynamic Binding in Strongly Typed Languagesby: Rex E. Gantenbein v. 22 i. 6 p. 69 - 75
- Implications of Automated Restructuring of COBOLby: J. Chris Miller, Burton M. Strauss III v. 22 i. 6 p. 76 - 82
- Design and Implementation of a C-based Language for Distributed Real-time Systemsby: A. Rizk, F. Halsall v. 22 i. 6 p. 83 - 100
- Compiling Fibonacci-Like Recursionby: Klaus Indermark, Herbert Klaeren v. 22 i. 6 p. 101 - 108
- Comments on an Example for Procedure Parametersby: David W. Krumme v. 22 i. 6 p. 109 - 111
- Visual Specification of Blocks in Programming Languagesby: Moreshwar R. Bhujade v. 22 i. 8 p. 24 - 26
- Implementing Separate Compilations in Pascalby: G. Nani v. 22 i. 8 p. 27 - 32
- Thoughts on "Extended Pascal - Illustrative Examples"by: Ronald T. House v. 22 i. 8 p. 33 - 38
- A Note on Metrics of Pascal Programby: Gordon Davies, A. Tan v. 22 i. 8 p. 39 - 44
- Implementation of Physical Unitsby: Geoff Baldwin v. 22 i. 8 p. 45 - 50
- An Object-Oriented Programming Language for Developing Distributed Softwareby: Shang Lujun, Sun Zhongxiu v. 22 i. 8 p. 51 - 56
- The Pascal-XT Code Generatorby: Karl-Heinz Drechsler, Manfred P. Stadel v. 22 i. 8 p. 56 - 78
- Experimental Comparison of Some Parsing Methodsby: Robert Gerardy v. 22 i. 8 p. 79 - 88
- Pancode and Boxcharts: Structured Programming Revisitedby: Dan Jonsson v. 22 i. 8 p. 89 - 98
- Response on Remarks on Recent Algorithms for LALR Lookahead Setsby: Fred Ives v. 22 i. 8 p. 99 - 104
- Comparison as a Value-yielding Operationby: Markku Sakkinen v. 22 i. 8 p. 105 - 110
- Recursion vs. non-Recursion in Pascal; a rejoinderby: Neil W. Rickert v. 22 i. 9 p. 12 - 13
- PCOL - A Protocol-Constrained Object Languageby: Jan van den Bos v. 22 i. 9 p. 14 - 19
- A Note Introducing Syntax Through Semantic Routinesby: John A. Ruf v. 22 i. 9 p. 20 - 22
- XC - A Language for Embedded Rule Based Systemsby: Esko Nuutila, Juha Kuusela, Markku Tamminen, Jukka Veilahti, Jari Arkko, Nassim Bouteldja v. 22 i. 9 p. 23 - 32
- Prolog Puzzlesby: Rommert J. Casimir v. 22 i. 9 p. 33 - 37
- Workshop Report: Third Workshop on the Mathematical Foundations of Programming Language Semantics, 1987, New Orleansby: David B. Benson, Michael G. Main v. 22 i. 9 p. 38 - 43
- The Astro Systemby: Irving B. Elliott v. 22 i. 9 p. 44 - 53
- How Objective Mechanisms Facilitate the Development of Large Software Systems in Three Programming Languagesby: Daniel R. Edelson v. 22 i. 9 p. 54 - 63
- SIGPLAN Notices Introduction to the Special Issue on the Interface Description Language IDLby: C. Robert Morgan v. 22 i. 11 p. 1 - 3
- IDL: Background and Statusby: Donald L. Stone, John R. Nestor v. 22 i. 11 p. 5 - 9
- Displaying IDL Instancesby: Richard T. Snodgrass v. 22 i. 11 p. 10 - 17
- A Tutorial Introduction to Using IDLby: William B. Warren, Jerry Kickenson, Richard T. Snodgrass v. 22 i. 11 p. 18 - 34
- Efficient Binary I/O of IDL Objectsby: Joseph M. Newcomer v. 22 i. 11 p. 35 - 43
- Implementation Strategies for DIANA Attributesby: David Alex Lamb v. 22 i. 11 p. 44 - 54
- Graph Attribution with Multiple Attribute Grammarsby: Johannes Röhrich v. 22 i. 11 p. 55 - 70
- IDL as a Data Description Language for a Programming Environmemnt Databaseby: Tor Didriksen, Anund Lie, Reidar Conradi v. 22 i. 11 p. 71 - 78
- Editing IDL Data Structuresby: Guido Persch v. 22 i. 11 p. 79 - 86
- Relationship between IDL and Structure Editor Generation Technologyby: Peter H. Feiler v. 22 i. 11 p. 87 - 94
- Extending IDL to Support Concurrent Viewsby: David Garlan v. 22 i. 11 p. 95 - 110
- A Demonstration of Three Requirements Language Systemsby: Joe Celko, John S. Davis, John Mitchell v. 18 i. 1 p. 9 - 14
- The Object Oriented Pre-Compilerby: Brad J. Cox v. 18 i. 1 p. 15 - 22
- On Formal and Informal Proofs for Program Correctnessby: Karel Culík v. 18 i. 1 p. 23 - 28
- A Subset Algorithm for Deterministic FSMs within Deterministic PDAsby: Dan R. Olsen v. 18 i. 1 p. 29 - 34
- Should Program Editors not Abandon Text Oriented Commands?by: Uri Shani v. 18 i. 1 p. 35 - 41
- The Simplest Functional Programming Languageby: David Spector v. 18 i. 1 p. 42 - 46
- Chatin's Graph Coloring Algorithm as a Method for Assigning Positions to Diana Attributesby: Arol Ambler, Robert Trawick v. 18 i. 2 p. 37 - 38
- Implementing Semaphores by Binary Semaphoresby: Hans W. Barz v. 18 i. 2 p. 39 - 45
- A New Methodology for Generating Test Cases for a Programming Language Compilerby: Daniel M. Berry v. 18 i. 2 p. 46 - 56
- A String Extension for Pascalby: F. D. Boswell, M. J. Carmody, T. R. Grove v. 18 i. 2 p. 57 - 61
- Run-time Print Valuesby: Raphael A. Finkel v. 18 i. 2 p. 62 - 64
- Context Senitive Formattingby: Manfred Jackel v. 18 i. 2 p. 65 - 68
- DUIF: A Data-Oriented Flowchart Environmemntby: E. M. J. C. Van Oost v. 18 i. 2 p. 69 - 75
- Complexity in Program Schemes: The Characteristic Polynomialby: Giovanni Cantone, Aniello Cimitile, Lucio Sansone v. 18 i. 3 p. 22 - 31
- Do-Select Reconsideredby: E. H. den Hertog, H. J. C. Gerbscheid, Martin L. Kersten v. 18 i. 3 p. 32 - 35
- Overview of Relational Programmingby: Bruce J. MacLennan v. 18 i. 3 p. 36 - 45
- PROGEN: A Programming Environmentby: Desiré Vermaak v. 18 i. 3 p. 46 - 47
- Modular Cby: Stowe Boyd v. 18 i. 4 p. 45 - 54
- The "Simplest Functional Programming Language" is neither Simple nor Functionalby: Elfriede Fehr v. 18 i. 4 p. 55 - 57
- Containment Defines a Class of Recursive Data Structuresby: Rhys S. Francis v. 18 i. 4 p. 58 - 64
- Nested Scopes in Pascal and Algol 68by: Norman Hardy v. 18 i. 4 p. 65 - 65
- An Algebraic Specification of Pascal's File Typeby: Alfred Laut v. 18 i. 4 p. 66 - 68
- OCCAMby: David May v. 18 i. 4 p. 69 - 79
- Discussion of Statement Labels; Proposal of a "Transfer/Junction" Construct as Alternative to "Goto"by: Karl L. Pentzlin v. 18 i. 4 p. 80 - 81
- The Next Control Structure That I Needby: F. Teiyeira de Queiroz v. 18 i. 4 p. 82 - 85
- In Defense of Teaching Structured COBOL as Computer Science (or, Notes on being Sage Struck)by: Howard E. Tompkins v. 18 i. 4 p. 86 - 94
- Completeness of many-sorted equational logicby: Joseph A. Goguen, José Meseguer v. 17 i. 1 p. 9 - 17
- Naming subprograms with clarityby: Grady Booch v. 17 i. 1 p. 18 - 22
- A Pascal compiler testing facilityby: D. F. Dixon v. 17 i. 1 p. 23 - 26
- Application of the goal invariant to the structuring of programsby: Janusz W. Laski v. 17 i. 1 p. 27 - 36
- Guidelines for writing PL/I programsby: Haim Kilov v. 17 i. 1 p. 37 - 39
- An extension to PASCAL input-output proceduresby: A. Bykat v. 17 i. 1 p. 40 - 41
- Classes: an abstract data type facility for the C languageby: Bjarne Stroustrup v. 17 i. 1 p. 42 - 51
- Comments on parameter passing techniques in programming languagesby: Kuo-Chung Tai v. 17 i. 2 p. 24 - 27
- Ada packages and distributed systemsby: W. H. Jessop v. 17 i. 2 p. 28 - 36
- Optional, repeatable, and varying type parametersby: G. Ford, B. Hansche v. 17 i. 2 p. 41 - 48
- More on bit processing with FORTRANby: T. N. Roberts v. 17 i. 2 p. 49 - 52
- A software debugging glossaryby: Mark Scott Johnson v. 17 i. 2 p. 53 - 70
- A theory of small program complexityby: Kenneth I. Magel v. 17 i. 3 p. 37 - 45
- The string as a simple data typeby: Ronald Morrison v. 17 i. 3 p. 46 - 52
- PASCAL for operating software? A critical examinationby: C. E. Prael v. 17 i. 3 p. 53 - 57
- Defining software science counting strategiesby: N. F. Salt v. 17 i. 3 p. 58 - 67
- A standard syntactic metalanguageby: R. S. Scowen v. 17 i. 3 p. 68 - 73
- Seven sorts of programsby: R. S. Scowen, Zbigniew Ciechanowicz v. 17 i. 3 p. 74 - 79
- Minimal overhead garbage collection of complex list structureby: David Spector v. 17 i. 3 p. 80 - 82
- The translation of programming languages through the use of a graph transformation languageby: P. van den Bosch v. 17 i. 3 p. 83 - 92
- Ambiguity and orthogonality in Adaby: P. van der Linden v. 17 i. 3 p. 93 - 94
- How do we tell truths that might hurt?by: Edsger W. Dijkstra v. 17 i. 5 p. 13 - 15
- A Technique for Finding Storage Allocation Errors in C-language Programsby: David R. Barach, David H. Taenzer v. 17 i. 5 p. 16 - 23
- Building Collections of LR(k) Items with Partial Expansion of Lookahead Stringsby: Massimo Ancona, Gabriella Dodero, Vittoria Gianuzzi v. 17 i. 5 p. 24 - 28
- APL Fins Its Aplombby: Mauro Guazzo v. 17 i. 5 p. 29 - 37
- A Separate Compilation Facility for Pascalby: Morris E. Kranc v. 17 i. 5 p. 38 - 46
- A Data Type Theoryby: Gebhard Greiter v. 17 i. 5 p. 47 - 53
- On Choosing Identifiersby: Breck Carter v. 17 i. 5 p. 54 - 59
- A Short Introduction to Concurrent Euclidby: Richard C. Holt v. 17 i. 5 p. 60 - 79
- Indirect Threaded Code used to emulate a virtual machineby: Nguyen the Thanh v. 17 i. 5 p. 80 - 89
- Compiler Test Setsby: Harlan K. Seyfer v. 17 i. 5 p. 90 - 97
- PS-algol: an Algol with a persistent heapby: Malcolm P. Atkinson, Kenneth Chisholm, W. Paul Cockshott v. 17 i. 7 p. 24 - 31
- A technique for finding storage allocation errors in C-language programsby: David R. Barach, David H. Taenzer, R. E. Wells v. 17 i. 7 p. 32 - 38
- Program editors should not abandon text oriented commandsby: Richard C. Waters v. 17 i. 7 p. 39 - 46
- A new LALR formalismby: Joseph C. H. Park v. 17 i. 7 p. 47 - 61
- Another look at enumerated typesby: David M. Harland, Hamish I. E. Gunn v. 17 i. 7 p. 62 - 71
- How to print with styleby: H. M. Gladney v. 17 i. 7 p. 72 - 79
- A note on GOTO-less programming in APL using the unquote-operatorby: R. Fischer v. 17 i. 7 p. 80 - 87
- English for Decision Tables Considered Harmfulby: Michael Lesk v. 17 i. 7 p. 88 - 88
- Structured Data Flow Programmingby: M. D. de Jong, C. L. Hankin v. 17 i. 8 p. 18 - 27
- Towards a Novel String Processing Languageby: Martin McCaig v. 17 i. 8 p. 28 - 33
- Functional Programming and the Two-Pass Assemblerby: Grady Early v. 17 i. 8 p. 34 - 42
- Ambiguities and Insecurities in Modula-2by: David Spector v. 17 i. 8 p. 43 - 51
- An Improvement Over Deeply Nested IF-THEN-ELSE Control Structuresby: Gregory P. Hill v. 17 i. 8 p. 52 - 56
- An Advanced Programming Language Definition and Domain Correctness of Programsby: Karel Culík v. 17 i. 8 p. 57 - 66
- A Comparison of LISP Specifications of Function Definition and Argument Handlingby: Mark A. Jones v. 17 i. 8 p. 67 - 73
- Epigrams on Programmingby: Alan J. Perlis v. 17 i. 9 p. 7 - 13
- The Effect of Parameter Passing and Other Implementation Dependent Mechanisms is Undecedableby: Matti O. Jokinen v. 17 i. 9 p. 16 - 17
- A Letter Oriented Minimal Perfect Hash Functionby: Curtis R. Cook, R. R. Oldehoeft v. 17 i. 9 p. 18 - 27
- Modula-2 - A Solution to Pascal's Problemsby: Roger T. Sumner, R. E. Gleaves v. 17 i. 9 p. 28 - 33
- Beyond Prolog: Software Specification by Grammarby: Walter W. Wilson v. 17 i. 9 p. 34 - 43
- A Nesting Level Complexity Measureby: Paul Piwowarski v. 17 i. 9 p. 44 - 50
- Object Oriented Programmingby: Tim Rentsch v. 17 i. 9 p. 51 - 57
- Remarks on Language Concepts for specifying Process Synchronizationby: G. Greiter v. 17 i. 9 p. 58 - 61
- On Data Flow Guided Program Testingby: Janusz W. Laski v. 17 i. 9 p. 62 - 71
- A Repetition Construct for UNIX Version 6by: David Marca v. 17 i. 9 p. 72 - 75
- A Comparative Survey of Concurrent Programming Languagesby: P. David Stotts v. 17 i. 9 p. 76 - 87
- Points Recurring - The History of a Railway Problemby: Roger G. Stone v. 17 i. 9 p. 88 - 94
- An Incremental Compilerby: Malcolm K. Crowe v. 17 i. 10 p. 13 - 22
- A Report on a PASCAL Questionaireby: Kenneth I. Magel v. 17 i. 10 p. 23 - 32
- Automatic Assessment Aids for Pascal Programsby: Michael J. Rees v. 17 i. 10 p. 33 - 42
- A Simple, Natural Notion for Applicative Languagesby: Bruce J. MacLennan v. 17 i. 10 p. 43 - 49
- A Comparative Survey of Concurrent Programming Languagesby: P. David Stotts v. 17 i. 10 p. 50 - 61
- Translator Writing Tools since 1970: A Selective Bibliography (June 1982)by: Hans Meijer, Anton Nijholt v. 17 i. 10 p. 62 - 72
- Syntax diagrams for ISO Pascal standardby: F. E. J. Kruseman Aretz v. 17 i. 10 p. 73 - 78
- Common Programming Language Ambiguityby: Paul D. Gootherts v. 17 i. 11 p. 7 - 10
- Syntax of Comments: Discussion and a Proposalby: Karl L. Pentzlin v. 17 i. 11 p. 11 - 13
- Notes from: The Aspenäs Symposium on Functional Languages and Computer Architectureby: Kent Karlsson, Kent Petersson v. 17 i. 11 p. 14 - 23
- The Case for Buffers in SNOBOL4by: Steven G. Duff v. 17 i. 11 p. 24 - 30
- Using Simple English Sentences to Call Proceduresby: Lindsay Groves v. 17 i. 11 p. 31 - 38
- The Case against Pascal as Teaching Toolby: Eric B. Levy v. 17 i. 11 p. 39 - 41
- A Basis for the Rate of Change in Programsby: A. J. Payne v. 17 i. 11 p. 42 - 44
- Text-Oriented Structure Commands for Structure Editorsby: Ellis Cohen v. 17 i. 11 p. 45 - 49
- Parallel Evolution Programming Language for Data Flow Machinesby: Yury Litvin v. 17 i. 11 p. 50 - 58
- A Revised Indexed Bibliography for LR Grammars and Parsersby: Colin Burgess, Laurence James v. 17 i. 12 p. 18 - 26
- A Style for Structured APLby: David E. Boddy v. 17 i. 12 p. 27 - 30
- How to avoid getting schlonked by Pascalby: Robert Cailliau v. 17 i. 12 p. 31 - 40
- Enhanced Arithmetic for Fortranby: Robert Paul Corbett v. 17 i. 12 p. 41 - 48
- An Overview of the B Programming Language - or: B without Tearsby: Leo Geurts v. 17 i. 12 p. 49 - 58
- A Note on Enumerationsby: H. M. Gladney v. 17 i. 12 p. 59 - 64
- Subtypes versus Cell Constancy With Subrange Constraintsby: David M. Harland v. 17 i. 12 p. 65 - 69
- Values and Objects in Programming Languagesby: Bruce J. MacLennan v. 17 i. 12 p. 70 - 79
- EPILOG = PROLOG + Data Flow: Arguments for Combining PROLOG with a Data Driven Mechanismby: Michael J. Wise v. 17 i. 12 p. 80 - 86
