Ashok K. Chandra, Dexter C. Kozen & Larry J. Stockmeyer (1981):
Alternation.
J. ACM 28,
pp. 114–133,
doi:10.1145/322234.322243.
Mario Coppo & Mariangiola Dezani-Ciancaglini. (1980):
An Extension of Basic Functionality Theory for Lambda-Calculus.
Notre Dame Journal of Formal Logic 21,
pp. 685–693,
doi:10.1305/ndjfl/1093883253.
Boris Düdder, Moritz Martens & Jakob Rehof (2011):
Prototype Implementation of an Inhabitation Algorithm for FCL(,łeq ).
Presentation at Types 2011 in Bergen, Norway.
Boris Düdder, Moritz Martens & Jakob Rehof (2012):
Intersection Type Matching and Bounded Combinatory Logic (Extended Version).
Technical Report 841.
Faculty of Computer Science (TU Dortmund).
http://ls14-www.cs.tu-dortmund.de/index.php/Jakob_Rehof_Publications#Technical_Reports.
Boris Düdder, Moritz Martens, Jakob Rehof & PawełUrzyczyn (2012):
Bounded Combinatory Logic.
In: Computer Science Logic (CSL'12),
LIPIcs 16.
Leibniz-Zentrum fuer Informatik,
pp. 243–258,
doi:10.4230/LIPIcs.CSL.2012.243.
Tim Freeman & Frank Pfenning (1991):
Refinement Types for ML.
In: ACM Conference on Programming Language Design and Implementation (PLDI).
ACM,
pp. 268–277,
doi:10.1145/113445.113468.
Oliver Garbe (2012):
Synthese von Benutzerschnittstellen mit einem Typinhabitationsalgorithmus.
Diploma thesis.
Technical University of Dortmund.
Christian Haack, Brian Howard, Allen Stoughton & Joe B. Wells (2002):
Fully Automatic Adaptation of Software Components Based on Semantic Specifications.
In: AMAST'02,
LNCS 2422.
Springer,
pp. 83–98,
doi:10.1007/3-540-45719-4_7.
Thomas Königsmann (2011):
Compositional Modelling Ansatz zur Benutzerschnittstellengenerierung am Beispiel telemedizinischer Anwendungen.
Technical University of Dortmund.
Thomas Königsmann & Reinholde Kriebel (2008):
Digitale Gesundheitsbegleiter am Beispiel der Adipositas-Nachsorge.
In: Proceedings of AAL 2008.
Verband der Elektrotechnik, Elektronik, Informationstechnik.
VDE-Verlag.
Y. Lustig & M. Y. Vardi (2009):
Synthesis from Component Libraries.
In: FOSSACS,
LNCS 5504.
Springer,
pp. 395–409,
doi:10.1007/978-3-642-00596-1_28.
Dale Miller, Gopalan Nadathur, Frank Pfenning & Andre Scedrov (1991):
Uniform Proofs as a Foundation for Logic Programming.
Ann. Pure Appl. Logic 51(1-2),
pp. 125–157,
doi:10.1016/0168-0072(91)90068-W.
Garrel Pottinger (1980):
A Type Assignment for the Strongly Normalizable Lambda-Terms.
In: J. Hindley & J. Seldin: To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism.
Academic Press,
pp. 561–577.
Jakob Rehof (2013):
Towards Combinatory Logic Synthesis.
In: Proceedings of BEAT'13.
ACM.
Jakob Rehof & PawełUrzyczyn (2011):
Finite Combinatory Logic with Intersection Types.
In: TLCA,
Lecture Notes in Computer Science 6690.
Springer,
pp. 169–183,
doi:10.1007/978-3-642-21691-6_15.
Jakob Rehof & PawełUrzyczyn (2012):
The Complexity of Inhabitation with Explicit Intersection.
In: Robert L. Constable & A. Silva: Kozen Festschrift LNCS 7230,
pp. 256–270,
doi:10.1007/978-3-642-29485-3_16.
Eugen Reinke (2011):
Konzeption und Entwicklung eines Tools zur Modellierung von User-Interface-Spezifikationsbausteinen im Rahmen des ``Compositional Modeling''-Ansatzes.
Diploma thesis.
Technical University of Dortmund.
Sylvain Salvati (2009):
Recognizability in the Simply Typed Lambda-Calculus.
In: H. Ono, M. Kanazawa & R. J. G. B. de Queiroz: WoLLIC,
LNCS 5514.
Springer,
pp. 48–60,
doi:10.1007/978-3-642-02261-6_5.
Sylvain Salvati, Giulio Manzonetto, Mai Gehrke & Henk Barendregt (2012):
Loader and Urzyczyn Are Logically Related.
In: ICALP 12, Automata, Languages, and Programming - 39th International Colloquium, Warwick, UK,
LNCS 7392.
Springer,
pp. 364–376,
doi:10.1007/978-3-642-31585-5_34.
Ehud Y. Shapiro (1984):
Alternation and the Computational Complexity of Logic Programs.
J. Log. Program. 1(1),
pp. 19–33,
doi:10.1016/0743-1066(84)90021-9.
J. B. Wells & Boris Yakobowski (2005):
Graph-Based Proof Counting and Enumeration with Applications for Program Fragment Synthesis.
In: Sandro Etalle: LOPSTR 2004,
LNCS 3573.
Springer,
pp. 262–277,
doi:10.1007/11506676_17.
Jan Wielemaker, Tom Schrijvers, Markus Triska & Torbjörn Lager (2010):
SWI-Prolog.
Computing Research Repository abs/1011.5332.
eptcs@eptcs.org