Gopalan Nadathur
Proceedings of the First International Conference on Principles and Practice of Declarative Programming
PPDP, 1999.
@proceedings{PPDP-1999, address = "Paris, France", editor = "Gopalan Nadathur", isbn = "3-540-66540-4", publisher = "{Springer-Verlag}", series = "{Lecture Notes in Computer Science}", title = "{Proceedings of the First International Conference on Principles and Practice of Declarative Programming}", volume = 1702, year = 1999, }
Contents (25 items)
- PPDP-1999-JonesRR #assembly #garbage collection #named
- C--: A Portable Assembly Language that Supports Garbage Collection (SLPJ, NR, FR), pp. 1–28.
- PPDP-1999-KamareddineM #on the #proving #recursion #termination
- On Formalised Proofs of Termination of Recursive Functions (FK, FM), pp. 29–46.
- PPDP-1999-KusakariNT
- Argument Filtering Transformation (KK, MN, YT), pp. 47–61.
- PPDP-1999-AnconaZ #calculus
- A Primitive Calculus for Module Systems (DA, EZ), pp. 62–79.
- PPDP-1999-Russo #dependent type #ml #standard
- Non-dependent Types for Standard ML Modules (CVR), pp. 80–97.
- PPDP-1999-HentenryckMPR #constraints #programming
- Constraint Programming in OPL (PVH, LM, LP, JCR), pp. 98–116.
- PPDP-1999-HolzbaurF #compilation #constraints #prolog
- Compiling Constraint Handling Rules into Prolog with Attributed Variables (CH, TWF), pp. 117–133.
- PPDP-1999-Ruiz-AndinoASR #constraints #execution #finite #modelling #parallel #programming
- Parallel Execution Models for Constraint Programming over Finite Domains (ARA, LA, FS, JJR), pp. 134–151.
- PPDP-1999-Arenas-SanchezLR #constraints #functional #logic programming
- Functional Plus Logic Programming with Built-In and Symbolic Constraints (PAS, FJLF, MRA), pp. 152–169.
- PPDP-1999-FernandezM #calculus #interactive
- A Calculus for Interaction Nets (MF, IM), pp. 170–187.
- PPDP-1999-Hanus #declarative #distributed #multi #programming
- Distributed Programming in a Multi-Paradigm Declarative Language (MH), pp. 188–205.
- PPDP-1999-Pfenning #framework #logic
- Logical and Meta-Logical Frameworks (FP), p. 206.
- PPDP-1999-BaldanCFP #abstract interpretation
- A Simple and General Method for Integrating Abstract Interpretation in SICStus (DB, NC, GF, FP), pp. 207–223.
- PPDP-1999-DowdSHCJ #runtime
- Run Time Type Information in Mercury (TD, ZS, FH, TCC, DJ), pp. 224–243.
- PPDP-1999-LopesSV #calculus #process #virtual machine
- A Virtual Machine for a Process Calculus (LMBL, FMAS, VTV), pp. 244–260.
- PPDP-1999-Costa #bytecode #optimisation #prolog
- Optimising Bytecode Emulation for Prolog (VSC), pp. 261–277.
- PPDP-1999-Davila #abduction #logic programming #named #programming language
- OPENLOG: A Logic Programming Language Based on Abduction (JAD), pp. 278–293.
- PPDP-1999-LuC #semantics
- An Operational Semantics of Starlog (LL, JGC), pp. 294–310.
- PPDP-1999-GoriL #finite #on the #verification
- On the Verification of Finite Failure (RG, GL), pp. 311–327.
- PPDP-1999-NeumerkelM #logic programming #source code
- Localizing and Explaining Reasons for Non-terminating Logic Programs with Failure-Slices (UN, FM), pp. 328–342.
- PPDP-1999-VerbaetenSS #composition #prolog #proving #termination
- Modular Termination Proofs for Prolog with Tabling (SV, KFS, DDS), pp. 342–359.
- PPDP-1999-CorrensonDPR #case study #declarative #deforestation #program transformation
- Declarative Program Transformation: A Deforestation Case-Study (LC, ÉD, DP, GR), pp. 360–377.
- PPDP-1999-Filinski #partial evaluation #semantics
- A Semantic Account of Type-Directed Partial Evaluation (AF), pp. 378–395.
- PPDP-1999-RoychoudhuryKRR #framework #logic programming #source code
- A Parameterized Unfold/Fold Transformation Framework for Definite Logic Programs (AR, KNK, CRR, IVR), pp. 396–413.
- PPDP-1999-ZaffanellaBH
- Widening Sharing (EZ, RB, PMH), pp. 414–432.
4 ×#constraints
4 ×#logic programming
3 ×#calculus
3 ×#programming
3 ×#prolog
2 ×#declarative
2 ×#finite
2 ×#framework
2 ×#named
2 ×#on the
4 ×#logic programming
3 ×#calculus
3 ×#programming
3 ×#prolog
2 ×#declarative
2 ×#finite
2 ×#framework
2 ×#named
2 ×#on the